Abstract
A leader of a tree T on [ n ] is a vertex which has no smaller descendants in T. Gessel and Seo showed that ∑ T ∈ T n u ( # of leaders in T ) c ( degree of 1 in T ) = u P n − 1 ( 1 , u , c u ) , which is a generalization of Cayley's formula, where T n is the set of trees on [ n ] and P n ( a , b , c ) = c ∏ i = 1 n − 1 ( i a + ( n − i ) b + c ) . Using a variation of the Prüfer code which is called a RP-code, we give a simple bijective proof of Gessel and Seo's formula.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
