论文信息 - A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees

A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees

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.

Seunghyun Seo

[1] Richard P. Stanley,et al. A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron , 2002, Discret. Comput. Geom..

[2] D. White,et al. Constructive combinatorics , 1986 .