On Cayley's formula for counting forests

DOI10.1016/0097-3165(90)90064-4zbMath0699.05004OpenAlexW2058120853WikidataQ56484249 ScholiaQ56484249MaRDI QIDQ912847

Lajos Takács

Publication date: 1990

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(90)90064-4

zbMATH Keywords

recurrence relationCayley's formula

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (2)

A new proof of Cayley's formula for labeled spanning trees ⋮ A new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über eine kombinatorische Frage
• On Cayley's Formula for Counting Trees
• Forests of labeled trees
• A Tree Counting Problem
• Another Proof of Cayley's Formula for Counting Trees

This page was built for publication: On Cayley's formula for counting forests