Martin Klazar  Home/Search
Context Related
| ms.mff.cuni.cz/acad/kam/kl...twelve2.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kam.mff.cuni.cz/~k...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The average number 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 on n vertices is 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 quantities and... (Update)
Cited by: More
Irreducible and Connected Permutations - Klazar (Correct)
On Planar Algebras Arising from Hypergroups - Green (Correct)
Active bibliography (related documents): More All
0.5: Trends in Topological Combinatorics - Kozlov (Correct)
0.3: Enumeration of P4-Free chordal graphs - Castelo, Wormald (2001) (Correct)
0.3: Enumeration of P4-Free Chordal Graphs - Castelo, Wormald (Correct)
Similar documents based on text: More All
0.6: Unknown - Martin Klazar To (Correct)
0.5: A Set Partition Identity Via Trees - Klazar, Novak (1996) (Correct)
0.4: Counting Bad Bracketings - Klazar (1996) (Correct)
BibTeX entry: (Update)
M. Klazar, Twelve countings with rooted plane trees, European J. Combin. 18 (1997), 195-- 210. http://citeseer.ist.psu.edu/klazar97twelve.html More
@misc{ klazar97twelve,
author = "M. Klazar",
title = "Twelve countings with rooted plane trees",
text = "M. Klazar, Twelve countings with rooted plane trees, European J. Combin.
18 (1997), 195-- 210.",
year = "1997",
url = "citeseer.ist.psu.edu/klazar97twelve.html" }
Citations (may not include all citations):154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983
92 line Encyclopedia of Integer Sequences - Sloane, On-
65 Asymptotic enumeration methods - Odlyzko
48 Asymptotic methods in enumeration (context) - Bender - 1976
14 an asymptotic method in enumeration (context) - Meir, Moon - 1989
13 Reidel Publishing Company (context) - Comtet, Combinatorics - 1974
10 Algebraic enumeration - Gessel, Stanley - 1995
8 Enumeration of trees by inversions - Gessel, Sagan et al. - 1995
7 Remarks on an asymptotic method in combinatorics (context) - Canfield - 1984
5 The complexity of orders (context) - Atkinson - 1989
2 BrookCole Advanced Book & Software (context) - Combinatorics, Cole et al. - 1986
1 partitions and continued fractions (context) - Chen, Ni et al. - 1994
Documents on the same site (http://kam.mff.cuni.cz/~klazar/publications.html): More
Extremal Problems for Colored Trees and Davenport-Schinzel.. - Klazar (1999) (Correct)
Counting pattern-free set partitions I: A generalization of.. - Klazar (2000) (Correct)
Bárány and Larman's combinatorial approach to the.. - Klazar (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC