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

DOI10.1016/0097-3165(95)90022-5MaRDI QIDQ1894017zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A short proof of Cayley's tree formula
• scientific article; zbMATH DE number 3906515
• A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations
• On Cayley's formula for counting forests
• Counting forests

Cites work

• scientific article; zbMATH DE number 3351606 (Why is no real title available?)
• On Cayley's Formula for Counting Trees
• The inversion enumerator for labeled trees

Cited in

(34)

• Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
• Arboretum for a generalisation of Ramanujan polynomials
• Cayley theorem on trees enumeration
• Stable multivariate Narayana polynomials and labeled plane trees
• \(q\)-log-convexity from linear transformations and polynomials with only real zeros
• A new proof of Cayley's formula for labeled spanning trees
• A bijective proof of the Shor recurrence
• A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations
• A context-free grammar for the Ramanujan-Shor polynomials
• A remark on the enumeration of rooted labeled trees
• On Cayley's formula for counting forests
• Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
• A REFINEMENT FOR ORDERED LABELED TREES
• scientific article; zbMATH DE number 4070934 (Why is no real title available?)
• A generalization of the Ramanujan polynomials and plane trees
• Derivatives of the tree function
• A counting formula for labeled, rooted forests
• Counting forests
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• Recognition and enumeration of the quasi-full rooted trees
• Runs in labelled trees and mappings
• Coalescent random forests
• scientific article; zbMATH DE number 3906515 (Why is no real title available?)
• scientific article; zbMATH DE number 1504579 (Why is no real title available?)
• A formula for the number of labelled trees
• A Telescopic Proof of Cayley’s Formula
• Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
• A short proof of Cayley's tree formula
• Some equidistributed statistics and applications to hook length formulas
• Maximizing phylogenetic diversity under ecological constraints: a parameterized complexity study
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• C-semiring Frameworks for Minimum Spanning Tree Problems
• Bijections behind the Ramanujan polynomials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894017)