Abstract
Most of the tree enumeration formulas are generating functions or recurrence formulas. In this article, we show the explicit formula for the number of unlabeled rooted trees with a certain condition. The formula is described in terms of Young tableaux.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cayley, A.: The Collected Mathematical Papers, Cambridge Library Collection-Mathematics, vol. 10. Cambridge University Press, Cambridge (2009). https://doi.org/10.1017/CBO9780511703768
Fulton, W.: Young Tableaux: With Applications to Representation Theory and Geometry. London Mathematical Society Student Texts. Cambridge University Press, Cambridge (1996). https://doi.org/10.1017/CBO9780511626241
Otter, R.: The number of trees. Ann. Math. 49(3), 583–599 (1948)
Pólya, G.: Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbindungen. Acta Math. 68(1), 145–254 (1937)
Acknowledgements
The author would like to thank Professor Norio Konno for his many variable comments and warm encouragement. She also wish to thank Professor Hideaki Morita for his variable comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ishikawa, A. An Explicit Formula Enumerating the Finely Bounded Trees Using Young Tableaux. Graphs and Combinatorics 36, 607–615 (2020). https://doi.org/10.1007/s00373-020-02138-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02138-z