Combinatorics and Asymptotics on Trees

Downloads

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.

Keywords

trees , generating functions , singularity analysis
  • Michael Drmota lnstitut F'ur Diskrete Mathematik und Geometrie , TU Wien, Wiedner Hauptstrasse 8-10/118, A-1040 Wien, Austria.
  • Pages: 105–136
  • Date Published: 2004-08-01
  • Vol. 6 No. 2 (2004): CUBO, A Mathematical Journal

Downloads

Download data is not yet available.

Published

2004-08-01

How to Cite

[1]
M. Drmota, “Combinatorics and Asymptotics on Trees”, CUBO, vol. 6, no. 2, pp. 105–136, Aug. 2004.

Issue

Vol. 6 No. 2 (2004): CUBO, A Mathematical Journal

Section

Articles