Limit theorems on sizes of trees in a random unlabelled forest
Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 70-86
Voir la notice de l'article provenant de la source Math-Net.Ru
We describe the asymptotic behaviour of the maximum size of a tree
and of the number of trees of a given size in a random forest
of $N$ trees and $n$ unlabelled vertices
in all domains where $N$, $n$ tend to infinity.
This research was supported by the program of the President of Russian Federation
of supporting leading scientific schools, grant 1758.2003.1.
@article{DM_2005_17_2_a4,
author = {Yu. L. Pavlov},
title = {Limit theorems on sizes of trees in a random unlabelled forest},
journal = {Diskretnaya Matematika},
pages = {70--86},
publisher = {mathdoc},
volume = {17},
number = {2},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2005_17_2_a4/}
}
Yu. L. Pavlov. Limit theorems on sizes of trees in a random unlabelled forest. Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 70-86. http://geodesic.mathdoc.fr/item/DM_2005_17_2_a4/