Bilabelled increasing trees and hook-length formulae

DOI10.1016/J.EJC.2011.09.043zbMATH Open1232.05096OpenAlexW2088308534MaRDI QIDQ658008FDOQ658008

Authors: Markus Kuba, Alois Panholzer 

Publication date: 11 January 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.043

Recommendations

• A multivariate hook formula for labelled trees
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• An edge-weighted hook formula for labelled trees
• On Han's hook length formulas for trees
• A new bijection on rooted forests

zbMATH Keywords

increasing bilabellings of trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Discovering hook length formulas by an expansion technique
• Analytic combinatorics
• Permutohedra, Associahedra, and Beyond
• A refinement of Cayley's formula for trees
• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• The doubloon polynomial triangle
• Hook length formulas for trees by Han's expansion
• A unifying approach for proving hook-length formulas for weighted tree families
• On Postnikov's hook length formula for binary trees
• Probabilistic proofs of hook length formulas involving trees

Cited In (13)

• A new bijection on rooted forests
• A unifying approach for proving hook-length formulas for weighted tree families
• On bucket increasing trees, clustered increasing trees and increasing diamonds
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• \(q\)-hook length formulas for signed labeled forests
• Weakly increasing trees on a multiset
• Tree hook length formulae, Feynman rules and B-series
• An edge-weighted hook formula for labelled trees
• A multivariate hook formula for labelled trees
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• On Postnikov's hook length formula for binary trees
• An insertion algorithm and leaders of rooted trees

Uses Software

• HookExp

This page was built for publication: Bilabelled increasing trees and hook-length formulae

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