A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations

DOI10.1007/S11253-023-02160-3MaRDI QIDQ6159044zbMATH OpenOpenAlexFDO

Authors O. L. Rebenko

Publication date 1 June 2023

Published in Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11253-023-02160-3

zbMATH Keywords

finite configurationslabeled rooted forest graphs

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A new proof of Cayley's formula for counting labeled trees
• On Cayley's formula for counting forests
• Counting forests
• A new proof of Cayley's formula for labeled spanning trees
• A short proof of Cayley's tree formula

Cites work

• A recursive algorithm for trees and forests
• On Cayley's formula for counting forests
• On the relationships between some approaches to the solution of Kirkwood-Salsburg equations
• Proofs from THE BOOK

Cited in

(8)

• A new proof of Cayley's formula for counting labeled trees
• A new proof of Cayley's formula for labeled spanning trees
• The poset of subpartitions and Cayley's formula for the complexity of a complete graph
• A short proof of Cayley's tree formula
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• A Telescopic Proof of Cayley’s Formula
• Counting forests
• On Cayley's formula for counting forests

This page was built for publication: A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations

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