Asymptotics of combinatorial structures with large smallest component
From MaRDI portal
Publication:598440
DOI10.1016/j.jcta.2004.04.001zbMath1048.05007MaRDI QIDQ598440
Daniel Panario, L. Bruce Richmond, Atefeh Mashatan, Edward A. Bender
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
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05A16: Asymptotic enumeration
Related Items
Permutations without long or short cycles, Local probabilities and total variation distance for random permutations
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