Asymptotics for the probability of connectedness and the distribution of number of components

From MaRDI portal

Revision as of 01:17, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1569274

Jump to:navigation, search

zbMath0948.05009MaRDI QIDQ1569274

Edward A. Bender, Jason P. Bell, L. Bruce Richmond, Peter J. Cameron

Publication date: 23 July 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120600

zbMATH Keywords

connectedness probability generating function number of components asymptotic probabilities fraction of structures

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Connectivity (05C40)

Related Items (6)

Asymptotics of combinatorial structures with large smallest component ⋮ Asymptotic enumeration and limit laws for multisets: the subexponential case ⋮ The Turán-Kubilius inequality for additive arithmetic semigroups ⋮ Random combinatorial structures: the convergent case ⋮ Asymptotics for logical limit laws: When the growth of the components is in an RT class ⋮ Unlabelled Gibbs partitions

This page was built for publication: Asymptotics for the probability of connectedness and the distribution of number of components

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1569274&oldid=13850114"