scientific article; zbMATH DE number 1545679

DOI10.1002/1098-2418(200010/12)17:3/4%3C343::AID-RSA8%3E3.0.CO;2-DMaRDI QIDQ4521552zbMATH OpenFDO

Authors Svante Janson

Publication date 19 December 2000

Full work available at URL https://doi.org/10.1002/1098-2418(200010/12)17:3/4%3C343::AID-RSA8%3E3.0.CO;2-D

zbMATH Keywords

complexitycomponentsgrowthrandom graph process

Mathematics Subject Classification ID

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

Recommendations

• On the growth of components with non-fixed excesses
• Birth and growth of multicyclic components in random hypergraphs
• Component behavior near the critical point of the random graph process
• Creation and Growth of Components in a Random Hypergraph Process
• Avoiding a giant component

Cited in

(11)

• Concentration inequalities using the entropy method
• Creation and Growth of Components in a Random Hypergraph Process
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• The asphericity of random 2‐dimensional complexes
• The birth of the giant component
• On the growth of components with non-fixed excesses
• On the growth of components with non-fixed excesses
• Birth and growth of multicyclic components in random hypergraphs
• The complexity of growing a graph
• A Markov chain approach to randomly grown graphs
• Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence

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 Q4521552)