Asymptotics of combinatorial structures with large smallest component

DOI10.1016/J.JCTA.2004.04.001MaRDI QIDQ598440zbMATH OpenOpenAlexFDO

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

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) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Recommendations

• Asymptotics of largest components in combinatorial structures
• Asymptotics for the probability of connectedness and the distribution of number of components
• scientific article; zbMATH DE number 5763331
• When structures are almost surely connected
• Asymptotics of smallest component sizes in decomposable structures of alg-log type

Cites work

• scientific article; zbMATH DE number 3125815 (Why is no real title available?)
• scientific article; zbMATH DE number 3485820 (Why is no real title available?)
• scientific article; zbMATH DE number 473229 (Why is no real title available?)
• Achiral plane trees
• Arithmetical semigroups related to trees and polyhedra
• Asymptotics for the probability of connectedness and the distribution of number of components
• Gaussian limiting distributions for the number of components in combinatorial structures
• On the number of trees in a random forest
• Smallest components in decomposable structures: Exp-log class
• Some methods for computing component distribution probabilities in relational structures
• The number of trees

Cited in

(9)

• Local probabilities and total variation distance for random permutations
• scientific article; zbMATH DE number 2127754 (Why is no real title available?)
• Asymptotics of largest components in combinatorial structures
• Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects
• Permutations without long or short cycles
• Asymptotic estimates for the number of permutations without short cycles
• A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
• scientific article; zbMATH DE number 5763331 (Why is no real title available?)
• Analytic number theory for 0-cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598440)