Counting cliques in a random graph

arXiv2208.07492MaRDI QIDQ6407954FDOQ6407954

Authors: Taro Sakurai, Norihide Tokushige 

Publication date: 15 August 2022

Abstract: We show that the expected number of cliques in the ErdH{o}s-R'enyi random graph $G(n,p)$ is $n^{frac1-2logp(logn-2loglogn+O(1))}$.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

This page was built for publication: Counting cliques in a random graph

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