A refinement of cayley's formula for trees

Electronic Journal of Combinatorics

Volumn 11, Issue 2 R, 2006, Pages 1-23

  Gessel, Ira M ^a   Seo, Seimghyun ^b  

^a BRANDEIS UNIVERSITY   (United States)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750476280     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. F. Bergeron, G. Labelle, and P. Leroux, Combinatorial Species and Tree-Like Structures, Encyclopedia of Mathematics and its Applications, 67, Cambridge University Press, Cambridge, 1997. Translated from the 1994 French original by Margaret Readdy.
2. A. Cayley, A theorem on trees, Quart. J. Math. 23 (1889), 376-378.
3. W. Y. C. Chen and V. J. W. Guo, Bijections behind the Ramanujan polynomials, Adv. in Appl. Math. 27 (2001), 336-356.
4. W. Y. C. Chen and L. L. M. Yang, On the hook length formula for binary trees, arXiv:math.CO/0504260.
5. R. R. X. Du and F. Liu, (k, m)-Catalan numbers and hook length polynomials for trees, arXiv:math.CO/0501147.
6. Ö. Eǧecioǧlu and J. B. Remmel, Bijections for Cayley trees, spanning trees, and their q-analogues, J. Combin. Theory Ser. A 42 (1986). 15-30.
7. I. M. Gessel, Counting forests by descents and leaves, Electron. J. Combin. 3 (1996), no. 2, #R8.
8. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, New York, 1983.
9. R. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd. edition, Addison-Wesley, Reading, MA, 1994.
10. L. H. Kalikow, Symmetries in trees and parking functions, Discrete Math. 256 (2002), 719-741.
11. D. E. Knuth, The Art of Computer Programming, Volume 3: Searching and Sorting, Addison-Wesley, Reading, MA, 1973.
12. A. Postnikov, Permutohedra, associahedra, and beyond, Retrospective in Combinatorics: Honoring Richard Stanley's 60th Birthday, Massachusetts Institute of Technology, Cambridge, Massachusetts, 2004. Slides of the talk are available at http://www-math.mit.edu/~apost/talks/perm-slides.pdf.
13. A. Postnikov, Permutohedra, associahedra, and beyond, arXiv:math.CO/0507163.
14. J. Riordan, Combinatorial Identities, Wiley, New York, 1968.
15. S. Seo, A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees, Electron. J. Combin. 11 (2) (2004-2005), #N3.
16. S. Seo and H. Shin, A generalized enumeration of labeled trees and reverse Prüfer algorithm, arXiv:math.CO/0601009.
17. P. W. Shor, A new proof of Cayley's formula for counting labeled trees, J. Combin. Theory Ser. A 71 (1995), 154-158.
18. R. P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks/Cole, Monterey, CA, 1986.
19. R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, 1999.
20. D. Stanton and D. White, Constructive Combinatorics, Springer-Verlag, New York, 1986.
21. C. Yan, Generalized parking functions, tree inversions, and multicolored graphs. Adv. in Appl. Math. 27 (2001), 641-670.
22. J. Zeng, A Ramanujan sequence that refines the Cayley formula for trees, Ramanujan J. 3 (1999), 45-54.