Small cliques in random graphs

DOI10.1002/RSA.3240010403MaRDI QIDQ3360207zbMATH OpenOpenAlexFDO

Authors Svante Janson, Michal Karonski, Andrzej Ruciński, A. D. Barbour

Publication date 1990

Published in Random Structures \& 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)

Recommendations

• scientific article; zbMATH DE number 1444472
• Cliques in random graphs
• Clique numbers of random subgraphs of some distance graphs
• scientific article; zbMATH DE number 1735728
• scientific article; zbMATH DE number 17684

Cited in

(7)

• Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
• Random Graphs, Retractions and Clique Graphs
• Maximal full subspaces in random projective spaces—thresholds and Poisson approximation
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• scientific article; zbMATH DE number 1444472 (Why is no real title available?)
• A short proof of a central limit theorem for the order of the giant component and k-core
• Neighbor selection and hitting probability in small-world graphs

This page was built for publication: Small cliques in random graphs

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