A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees

zbMath1082.05008arXivmath/0409323MaRDI QIDQ1773142

Seung-Hyun Seo

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0409323

zbMATH Keywords

\(k\)-ary treesrooted labeled treesbicolored binary treesbicolored rooted treeslabeled plane trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (9)

A generalized enumeration of labeled trees and reverse Prüfer algorithm ⋮ Bijections on rooted trees with fixed size of maximal decreasing subtrees ⋮ \((k,m)\)-Catalan numbers and hook length polynomials for plane trees ⋮ An insertion algorithm and leaders of rooted trees ⋮ Bilabelled increasing trees and hook-length formulae ⋮ Hook length polynomials for plane forests of a certain type ⋮ On Postnikov's hook length formula for binary trees ⋮ Trees, functional equations, and combinatorial Hopf algebras ⋮ Two kinds of hook length formulas for complete \(m\)-ary trees

This page was built for publication: A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees