Counting cliques in a random graph
Abstract
We show that the expected number of cliques in the Erdos-R\'enyi random graph G(n,p) is n1-2 p( n-2 n+O(1)).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.