Hostname: page-component-7479d7b7d-767nl Total loading time: 0 Render date: 2024-07-11T05:23:52.711Z Has data issue: false hasContentIssue false
  • English
  • Français

On the height of trees

Published online by Cambridge University Press:  09 April 2009

A. Rényi  and
G. Szekeres
A. Rényi
Affiliation:
Mathematical Institute of the Academy, Budapest
G. Szekeres
Affiliation:
University of New South Wales
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note we shall deal with the enumeration of labelled trees of given order and given height over a selected point.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 7 , Issue 4 , November 1967 , pp. 497 - 507
Copyright
Copyright © Australian Mathematical Society 1967

References

[1]Cayley, A., ‘A theorem on trees’, Quart. J. of Pure and Applied Math. 23 (1889), 376–378.Google Scholar
[2]Riordan, J., ‘The enumeration of trees by height and diameter’, IBM Journal of Research and Development 4 (1960), 473–478.CrossRefGoogle Scholar
[3]Szekeres, G., ‘Regular iteration of real and complex functions’, Acta Math. 100 (1958), 103–258.CrossRefGoogle Scholar
[4]Fatou, M. P., ‘Sur les équations fonctionnelles’, Bull. Soc. Math. France 47 (1919), 161–271.CrossRefGoogle Scholar