Counting cliques in a random graph

preprint2022arXivOpen access

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

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract