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

Details 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

2004-09-18

arxiv.org/abs/math/0409323v1

Mathematics

Combinatorics

9 pages, 3 figures (use PSTricks)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304874