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

@article{Seo2005ACP,
  title={A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees},
  author={Seunghyun Seo},
  journal={Electr. J. Comb.},
  year={2005},
  volume={11}
}
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. 

From This Paper

Figures, tables, and topics from this paper.
10 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Constructive Combinatorics

  • D. Stanton, D. White
  • Springer-Verlag, New York, 1986. the electronic…
  • 2005
Highly Influential
4 Excerpts

A theorem on trees

  • A. Cayley
  • Quart. J. Math. 23
  • 1889
Highly Influential
4 Excerpts

Permutohedra

  • A. Postnikov
  • associahedra, and beyond, Retrospective in…
  • 2004
3 Excerpts

Enumerative Combinatorics

  • R. P. Stanley
  • Vol. 2, Cambridge University Press, Cambridge
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…