Pages that link to "Item:Q813443"
From MaRDI portal
The following pages link to A refinement of Cayley's formula for trees (Q813443):
Displaying 42 items.
- On the free Lie algebra with multiple brackets (Q288995) (← links)
- Bijections on rooted trees with fixed size of maximal decreasing subtrees (Q360359) (← links)
- Bijections between affine hyperplane arrangements and valued graphs (Q491732) (← links)
- Combinatorial families of multilabelled increasing trees and hook-length formulas (Q501056) (← links)
- Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
- Hook length polynomials for plane forests of a certain type (Q659804) (← links)
- Runs in labelled trees and mappings (Q776318) (← links)
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices (Q820844) (← 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)
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions (Q1601429) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees (Q1773142) (← links)
- Ramanujan grammar and Cayley trees (Q1918894) (← links)
- Cycle structure of random parking functions (Q2111199) (← links)
- Connecting \(k\)-Naples parking functions and obstructed parking functions via involutions (Q2153403) (← links)
- Enumerating parking completions using join and split (Q2188834) (← links)
- Parking functions on directed graphs and some directed trees (Q2188840) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
- Prime parking functions on rooted trees (Q2326324) (← links)
- Probabilizing parking functions (Q2360728) (← links)
- A generalization of the Ramanujan polynomials and plane trees (Q2383532) (← links)
- A generalized enumeration of labeled trees and reverse Prüfer algorithm (Q2384578) (← links)
- Disposition polynomials and plane trees (Q2441620) (← links)
- A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial (Q2635084) (← links)
- A unifying approach for proving hook-length formulas for weighted tree families (Q2637731) (← links)
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees (Q2684476) (← links)
- On the (co)homology of the poset of weighted partitions (Q2796077) (← links)
- Pattern restricted quasi-Stirling permutations (Q5197606) (← links)
- New hook length formulas for binary trees (Q5916092) (← links)
- New hook length formulas for binary trees (Q5917910) (← links)
- Parking functions: interdisciplinary connections (Q6068842) (← links)
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity (Q6070008) (← links)
- The Moran forest (Q6074654) (← links)
- \(k\)-factorizations of the full cycle and generalized Mahonian statistics on \(k\)-forests (Q6094845) (← links)
- Unit interval parking functions and the \(r\)-Fubini numbers (Q6130359) (← links)
- Probabilistic parking functions (Q6133160) (← links)
- Parking functions: from combinatorics to probability (Q6164864) (← links)
- On Parking Functions and The Tower of Hanoi (Q6170934) (← links)
- On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions (Q6195953) (← links)
- On the lucky and displacement statistics of Stirling permutations (Q6597280) (← links)
