Small cliques in random graphs

DOI10.1002/rsa.3240010403zbMath0733.05050OpenAlexW2156924276MaRDI QIDQ3360207

Andrzej Ruciński, Svante Janson, Michał Karoński, Andrew David Barbour

Publication date: 1990

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

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

zbMATH Keywords

binomial random graphd-clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Random Regular Graphs: Asymptotic Distributions and Contiguity, Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing, Maximal full subspaces in random projective spaces—thresholds and Poisson approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item