Counting cliques in a random graph

Abstract

We show that the expected number of cliques in the Erdős-Rényi random graph $G(n,p)$ is $n^{\frac{1}{-2\log p}(\log n-2\log \log n+O(1))}$.

4 pages