A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2
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.
DOI :
10.37236/1890
Classification :
05A15, 05C05, 05C30
Mots-clés : bicolored rooted trees, bicolored binary trees, \(k\)-ary trees, rooted labeled trees, labeled plane trees
Mots-clés : bicolored rooted trees, bicolored binary trees, \(k\)-ary trees, rooted labeled trees, labeled plane trees
@article{10_37236_1890,
author = {Seunghyun Seo},
title = {A combinatorial proof of {{P}ostnikov's} identity and a generalized enumeration of labeled trees},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {2},
doi = {10.37236/1890},
zbl = {1082.05008},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1890/}
}
Seunghyun Seo. A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees. The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2. doi: 10.37236/1890
Cité par Sources :