Pages that link to "Item:Q1773142"
From MaRDI portal
The following pages link to A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees (Q1773142):
Displayed 9 items.
- Bijections on rooted trees with fixed size of maximal decreasing subtrees (Q360359) (← links)
- Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
- Hook length polynomials for plane forests of a certain type (Q659804) (← links)
- \((k,m)\)-Catalan numbers and hook length polynomials for plane trees (Q875066) (← links)
- An insertion algorithm and leaders of rooted trees (Q901150) (← links)
- On Postnikov's hook length formula for binary trees (Q942125) (← links)
- Trees, functional equations, and combinatorial Hopf algebras (Q942137) (← links)
- Two kinds of hook length formulas for complete \(m\)-ary trees (Q1025531) (← links)
- A generalized enumeration of labeled trees and reverse Prüfer algorithm (Q2384578) (← links)