We propose a new very simple proof of the formula for the number of labeled root forest graphs with a given number of vertices. As a partial case of this formula, we obtain Cayley’s formula.
Similar content being viewed by others
References
M. Aigner and G. M. Ziegler, Proofs from the Book, 4th ed., Springer, Berlin (2010).
S. Guo and V. J. W. Guo, “A recursive algorithm for trees and forests,” Discrete Math., 340, 695–703 (2017).
R. A. Minlos and S. K. Poghosyan, “Estimates of Ursell functions, group functions, and their derivatives,” Theor. Math. Phys., 31, No. 2, 408–418 (1977).
J. W. Moon, “Various proofs of Cayley’s formula for counting trees,” in: F. Harary (editor), A Seminar on Graph Theory, Holt, Rinehart, and Winston, New York (1967), pp. 70–78.
O. L. Rebenko, “On the relationship between some approaches to the solution of Kirkwood–Salsburg equations,” Ukr. Mat. Zh., 73, No. 3, 381–394 (2021); English translation: Ukr. Math. J., 73, No. 3, 447–462 (2021).
L. Takacs, “On Cayley’s formula for counting forests,” J. Combin. Theory, Ser. A, 53, 321–323 (1990).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 74, No. 10, pp. 1441–1444, October, 2022. Ukrainian DOI: https://doi.org/10.37863/umzh.v74i10.7156.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Rebenko, O.L. A New Simple Proof of Cayley’s Formula and its Relationship with the Kirkwood–Salzburg Equations. Ukr Math J 74, 1645–1648 (2023). https://doi.org/10.1007/s11253-023-02160-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-023-02160-3