A new proof of Cayley's formula for counting labeled trees

DOI10.1016/0097-3165(95)90022-5zbMath0826.05036OpenAlexW1987139164MaRDI QIDQ1894017

Peter W. Shor

Publication date: 21 August 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90022-5

zbMATH Keywords

enumerationlabeled treesCayley's formula

Mathematics Subject Classification ID

Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Related Items (17)

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ A new proof of Cayley's formula for labeled spanning trees ⋮ Arboretum for a generalisation of Ramanujan polynomials ⋮ A generalization of the Ramanujan polynomials and plane trees ⋮ C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ \(q\)-log-convexity from linear transformations and polynomials with only real zeros ⋮ A remark on the enumeration of rooted labeled trees ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ A bijective proof of the Shor recurrence ⋮ A context-free grammar for the Ramanujan-Shor polynomials ⋮ Bijections behind the Ramanujan polynomials ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ Derivatives of the tree function ⋮ Coalescent random forests ⋮ Runs in labelled trees and mappings ⋮ A REFINEMENT FOR ORDERED LABELED TREES ⋮ Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions

Cites Work

• Unnamed Item
• On Cayley's Formula for Counting Trees
• The inversion enumerator for labeled trees

This page was built for publication: A new proof of Cayley's formula for counting labeled trees