Pages that link to "Item:Q1773142"

The following pages link to A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees (Q1773142):

Displaying 18 items.

• Bijections on rooted trees with fixed size of maximal decreasing subtrees (Q360359) (← links)
• Labeled trees, functions, and an algebraic identity (Q640448) (← links)
• Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
• Hook length polynomials for plane forests of a certain type (Q659804) (← links)
• Two short proofs of Kemp's identity for rooted plane trees (Q802559) (← links)
• A refinement of Cayley's formula for trees (Q813443) (← 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)
• A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution (Q1010768) (← links)
• Two kinds of hook length formulas for complete \(m\)-ary trees (Q1025531) (← links)
• Generalized (\(P\), \(\omega\))-partitions and generating functions for trees (Q1399914) (← links)
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees (Q1826940) (← links)
• Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti (Q1885017) (← links)
• A combinatorial identity for rooted labeled forests (Q2307654) (← links)
• A generalized enumeration of labeled trees and reverse Prüfer algorithm (Q2384578) (← links)
• (Q3023984) (← links)