Asymptotics of combinatorial structures with large smallest component

DOI10.1016/j.jcta.2004.04.001zbMath1048.05007OpenAlexW2102747227MaRDI QIDQ598440

L. Bruce Richmond, Edward A. Bender, Daniel Panario, Atefeh Mashatan

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.04.001

zbMATH Keywords

Combinatorial enumerationComponentsConnectedness

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (4)

Permutations without long or short cycles ⋮ Local probabilities and total variation distance for random permutations ⋮ Analytic number theory for 0-cycles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian limiting distributions for the number of components in combinatorial structures
• On the number of trees in a random forest
• Some methods for computing component distribution probabilities in relational structures
• Arithmetical semigroups related to trees and polyhedra
• Asymptotics for the probability of connectedness and the distribution of number of components
• Smallest components in decomposable structures: Exp-log class
• The number of trees
• Achiral plane trees

This page was built for publication: Asymptotics of combinatorial structures with large smallest component