Cited in
(15)- The weighted hook length formula
- Some Conjectures and Open Problems on Partition Hook Lengths
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- A unifying approach for proving hook-length formulas for weighted tree families
- Hook lengths and shifted parts of partitions
- Colored partitions and the hooklength formula: partition statistic identities
- A note on some new hook-content identities
- Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
- Towards Heim and Neuhauser's unimodality conjecture on the Nekrasov-Okounkov polynomials
- On Han's hook length formulas for trees
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- Note on ``hook-length as a graph invariant of trees
- Bilabelled increasing trees and hook-length formulae
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
- Hook length formulas for trees by Han's expansion
This page was built for software: HookExp
