The number of rooted trees of given depth

zbMath1266.05011MaRDI QIDQ1953527

András Pongrácz, Péter Pál Pach, Gabriella Pluhár, Csaba Szabó

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p38

zbMATH Keywords

countingdepth

Mathematics Subject Classification ID

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

Related Items (2)

The fine- and generative spectra of varieties of monounary algebras ⋮ Quantification and statistical analysis of topological features of recursive trees

Cites Work

• Unnamed Item
• The shape of unlabeled rooted random trees
• The number of trees
• On the expansion of the partition functions in a series
• The height of random binary unlabelled trees
• Random Trees

This page was built for publication: The number of rooted trees of given depth