Combinatorics and Asymptotics on Trees

Michael Drmota

Combinatorics and Asymptotics on Trees

Authors

Michael Drmota lnstitut F'ur Diskrete Mathematik und Geometrie , TU Wien, Wiedner Hauptstrasse 8-10/118, A-1040 Wien, Austria.

Keywords:

trees, generating functions, singularity analysis

Abstract

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.