Countable sparse random graphs

DOI10.1002/RSA.3240010207zbMATH Open0747.05081OpenAlexW2102096157MaRDI QIDQ3977076FDOQ3977076

Joel Spencer

Publication date: 25 June 1992

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010207

zbMATH Keywords

random graphzero-one laws

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20)

Cited In (5)

• On local weak limit and subgraph counts for sparse random graphs
• Sparse quasi-random graphs
• A counting lemma for sparse pseudorandom hypergraphs
• Zero-one laws with variable probability
• Random graphs of binomial type with sparsely-edged initial graphs

This page was built for publication: Countable sparse random graphs

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