scientific article; zbMATH DE number 932188

DOI10.1002/(SICI)1098-2418(199608/09)9:1/2%3C253::AID-RSA15%3E3.0.CO;2-OMaRDI QIDQ4894612zbMATH OpenFDO

Authors Nicholas Wormald

Publication date 7 October 1996

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2%3C253::AID-RSA15%3E3.0.CO;2-O

zbMATH Keywords

perturbationprobabilityrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited in

(9)

• Asymptotic enumeration of convex polygons
• On the probability of nonexistence in binomial subsets
• Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
• Exchangeable pairs, switchings, and random regular graphs
• The probability of non-existence of a subgraph in a moderately sparse random graph
• Triangles in randomly perturbed graphs
• On the zeroes of hypergraph independence polynomials
• The degree-restricted random process is far from uniform
• On the evolution of structure in triangle-free graphs

This page was built for publication:

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