The number of rooted trees of given depth
type: Item
instance of: scholarly article
title: The number of rooted trees of given depth
zbMATH Open document ID: 1266.05011
author: Péter Pál Pach
author: Gabriella Pluhár
author: András Pongrácz
author: Csaba Szabó
published in: The Electronic Journal of Combinatorics
publication date: 2013-06-07T00:00:00Z
full work available at URL: v20i2p38
review text: Summary: In this paper it is shown that the logarithm of the number of non-isomorphic rooted trees of depth \(k\geq 3\) is asymptotically \(\frac{\pi^2}{6}\cdot\frac{n}{\log\log\dots\log n}\), where \(\log\) is iterated \(k-2\) times in the denominator.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A16
zbMATH DE Number: 6171953
zbMATH Keywords: depth
zbMATH Keywords: counting
MaRDI profile type: Publication
cites work: The height of random binary unlabelled trees
cites work: Random Trees
cites work: The shape of unlabeled rooted random trees
cites work: Q3549563
cites work: The number of trees
cites work: On the expansion of the partition functions in a series
description: scientific article; zbMATH DE number 6171953