The purpose of this article is to present explicit and asymptotic methods to count various kinds of trees. In all cases the use of generating functions is essential. Explicit formulae are derived with help of Lagrange's inversion formula. On the other hand singularity analysis of generating functions leads to aymptotic formulas.
@article{1642,
title = {Combinatorics and Asymptotics on Trees},
journal = {CUBO, A Mathematical Journal},
volume = {6},
year = {2004},
language = {en},
url = {http://dml.mathdoc.fr/item/1642}
}
Drmota, Michael. Combinatorics and Asymptotics on Trees. CUBO, A Mathematical Journal, Tome 6 (2004) . http://gdmltest.u-ga.fr/item/1642/