A unifying approach for proving hook-length formulas for weighted tree families

DOI10.1007/s00373-012-1217-4zbMath1287.05009OpenAlexW2054766372MaRDI QIDQ2637731

Markus Kuba, Alois Panholzer

Publication date: 14 February 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1217-4

zbMATH Keywords

increasing treesweighted treesimply generated treeshook-length formula

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Signed and weighted graphs (05C22)

Related Items (4)

An insertion algorithm and leaders of rooted trees ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Bilabelled increasing trees and hook-length formulae ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas

Uses Software

• HookExp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the average shape of monotonically labelled tree structures
• A refinement of Cayley's formula for trees
• Discovering hook length formulas by an expansion technique
• Hook length formulas for trees by Han's expansion
• Bijections for ternary trees and non-crossing trees
• On monotone functions of tree structures
• Invariance principles for random bipartite planar maps
• Probabilistic proofs of hook length formulas involving trees
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• Permutohedra, Associahedra, and Beyond
• On the Altitude of Nodes in Random Trees
• Enumeration of trees by inversions
• New hook length formulas for binary trees

This page was built for publication: A unifying approach for proving hook-length formulas for weighted tree families