Bilabelled increasing trees and hook-length formulae
From MaRDI portal
Publication:658008
DOI10.1016/j.ejc.2011.09.043zbMath1232.05096OpenAlexW2088308534MaRDI QIDQ658008
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
Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (4)
On bucket increasing trees, clustered increasing trees and increasing diamonds ⋮ An insertion algorithm and leaders of rooted trees ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Weakly increasing trees on a multiset
Uses Software
Cites Work
- Unnamed Item
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
- The doubloon polynomial triangle
- A refinement of Cayley's formula for trees
- On Postnikov's hook length formula for binary trees
- Discovering hook length formulas by an expansion technique
- Hook length formulas for trees by Han's expansion
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A unifying approach for proving hook-length formulas for weighted tree families
- Probabilistic proofs of hook length formulas involving trees
- Permutohedra, Associahedra, and Beyond
This page was built for publication: Bilabelled increasing trees and hook-length formulae