Skip to main content
Log in

An Explicit Formula Enumerating the Finely Bounded Trees Using Young Tableaux

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Cayley, A.: The Collected Mathematical Papers, Cambridge Library Collection-Mathematics, vol. 10. Cambridge University Press, Cambridge (2009). https://doi.org/10.1017/CBO9780511703768

    Book  Google Scholar 

  2. 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

    Book  Google Scholar 

  3. Otter, R.: The number of trees. Ann. Math. 49(3), 583–599 (1948)

    Article  MathSciNet  Google Scholar 

  4. Pólya, G.: Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbindungen. Acta Math. 68(1), 145–254 (1937)

    Article  MathSciNet  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Ayaka Ishikawa.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02138-z

Keywords

Navigation