Pages that link to "Item:Q2637731"

The following pages link to A unifying approach for proving hook-length formulas for weighted tree families (Q2637731):

Displaying 15 items.

• An edge-weighted hook formula for labelled trees (Q477977) (← links)
• Combinatorial families of multilabelled increasing trees and hook-length formulas (Q501056) (← links)
• Note on ``hook-length'' as a graph invariant of trees (Q501992) (← links)
• The weighted hook length formula (Q543902) (← links)
• Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
• An insertion algorithm and leaders of rooted trees (Q901150) (← links)
• On Postnikov's hook length formula for binary trees (Q942125) (← links)
• Discovering hook length formulas by an expansion technique (Q1010868) (← links)
• Two kinds of hook length formulas for complete \(m\)-ary trees (Q1025531) (← links)
• Hook length formulas for trees by Han's expansion (Q1028843) (← links)
• A multivariate hook formula for labelled trees (Q1946744) (← links)
• The weighted hook-length formula. II: Complementary formulas (Q2430975) (← links)
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees (Q3563932) (← links)
• (Q4591295) (← links)
• The combinatorics of a tree-like functional equation for connected chord diagrams (Q6204690) (← links)