A Refinement of Cayley's Formula for Trees

  title={A Refinement of Cayley's Formula for Trees},
  author={Ira M. Gessel and Seunghyun Seo},
  journal={Electr. J. Comb.},
A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all expressed in terms of the polynomials P n (a, b, c) = c n−1 i=1 (ia + (n − i)b + c), which reduce to to (n + 1) n−1 for a = b = c = 1. Our study of proper vertices was motivated by Postnikov's hook length formula (n + 1) n−1 = n! 2 n T v 1 + 1 h(v) , where the sum… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 18 references

A theorem on trees

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

A Ramanujan sequence that refines the Cayley formula for trees

  • J. Zeng
  • Ramanujan J. 3 (1999), 45–54. the electronic…
  • 2006
2 Excerpts


  • A. Postnikov
  • associahedra, and beyond, Retrospective in…
  • 2004
1 Excerpt

Enumerative Combinatorics

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

Combinatorial Species and Tree-Like Structures

  • F. Bergeron, G. Labelle, P. Leroux
  • Encyclopedia of Mathematics and its Applications…
  • 1997
2 Excerpts

Translated from the 1994 French original by Margaret Readdy

  • G. Labelle F. Bergeron, P. Leroux
  • Combinatorial species and tree - like structures…
  • 1997

Similar Papers

Loading similar papers…