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

Seunghyun Seo

The Electronic Journal of Combinatorics · 2005 · 30 citations · 1 references

DOIFull text

Open access

Concepts

Abstract

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.

References

1