Year: 2022
Type: preprint
Abstract: 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))}$.
Source: arXiv (Cornell University)
Authors: Sakurai, Taro, Tokushige, Norihide
Institutions: Chiba University, University of the Ryukyus
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4298222267