论文信息 - Twelve Countings with Rooted Plane Trees

Twelve Countings with Rooted Plane Trees

The average numbers of (1) antichains, (2) maximal antichains, (3) chains, (4) infima closed sets, (5) connected sets, (6) independent sets, (7) maximal independent sets, (8) brooms, (9) matchings, (10) maximal matchings, (11) linear extensions and (12) drawings in (of) a rooted plane tree onnvertices are investigated. Using generating functions we determine the asymptotics and give some explicit formulae and identities. In conclusion, we discuss the extremal values of the above quantitites and pose some problems.

Martin Klazar | M. Klazar | Martin Klazar

[1] Wen-Chin Chen,et al. Heap-ordered Trees, 2-Partitions and Continued Fractions , 1994, Eur. J. Comb..

[2] John W. Moon,et al. On an asymptotic method in enumeration , 1989, J. Comb. Theory, Ser. A.

[3] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[4] M. D. Atkinson. The Complexity of Orders , 1989 .

[5] A. Odlyzko. Asymptotic enumeration methods , 1996 .

[6] E. Bender. Asymptotic Methods in Enumeration , 1974 .

[7] Yeong-Nan Yeh,et al. Enumeration of trees by inversions , 1995, J. Graph Theory.

[8] E. Rodney Canfield. Remarks on an Asymptotic Method in Combinatorics , 1984, J. Comb. Theory, Ser. A.

[9] R. Stanley,et al. Algebraic enumeration , 1996 .

[10] Herbert S. Wilf,et al. Generating functionology , 1990 .