arXiv Analytics

Sign in

arXiv:math/0409323 [math.CO]AbstractReferencesReviewsResources

A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees

Seunghyun Seo

Published 2004-09-18Version 1

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.

Comments: 9 pages, 3 figures (use PSTricks)
Categories: math.CO
Subjects: 05A15, 05C05, 05C30
Related articles: Most relevant | Search more
arXiv:0902.2444 [math.CO] (Published 2009-02-14)
A combinatorial proof of a formula for Betti numbers of a stacked polytope
arXiv:1502.07674 [math.CO] (Published 2015-02-26)
Another combinatorial proof of a result of Zagier and Stanley
arXiv:1506.06186 [math.CO] (Published 2015-06-20)
A combinatorial proof of a relationship between maximal $(2k-1,2k+1)$ and $(2k-1,2k,2k+1)$-cores

Links

Toolbox