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

zbMATH Open1082.05008arXivmath/0409323MaRDI QIDQ1773142FDOQ1773142

Authors: Seung-Hyun Seo 

Publication date: 25 April 2005

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

Abstract: 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.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Postnikov identities and Seo's formulas
• A refinement of Cayley's formula for trees
• scientific article; zbMATH DE number 3926929
• Labeled trees, functions, and an algebraic identity
• Enumerating alternating trees

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)

Cited In (21)

• Generalized (\(P\), \(\omega\))-partitions and generating functions for trees
• Trees, functional equations, and combinatorial Hopf algebras
• \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
• Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
• Title not available (Why is that?)
• A refinement of Cayley's formula for trees
• A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution
• More Trees and Power Sums
• Labeled trees, functions, and an algebraic identity
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• Postnikov identities and Seo's formulas
• Bilabelled increasing trees and hook-length formulae
• A combinatorial identity for rooted labeled forests
• Hook length polynomials for plane forests of a certain type
• Two short proofs of Kemp's identity for rooted plane trees
• On Postnikov's hook length formula for binary trees
• Two kinds of hook length formulas for complete \(m\)-ary trees
• An insertion algorithm and leaders of rooted trees
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• Some refined enumerations of hybrid binary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773142)