Counting cliques in a random graph
Combinatorics
2022-08-17 v1 Probability
Abstract
We show that the expected number of cliques in the Erd\H{o}s-R\'enyi random graph G(n,p) is n−2logp1(logn−2loglogn+O(1)).
Keywords
Cite
@article{arxiv.2208.07492,
title = {Counting cliques in a random graph},
author = {Taro Sakurai and Norihide Tokushige},
journal= {arXiv preprint arXiv:2208.07492},
year = {2022}
}
Comments
4 pages
Related papers
View all related →
Combinatorics · Mathematics
Covering the edges of a random graph by cliques
Alan Frieze, Bruce Reed
2011-03-28
Combinatorics · Mathematics
Cliques in dense inhomogeneous random graphs
Martin Doležal, Jan Hladký, András Máthé
2018-12-04
Combinatorics · Mathematics
Clique packings in random graphs
Simon Griffiths, Letícia Mattos
2025-10-15
Combinatorics · Mathematics
On Emergence of Dominating Cliques in Random Graphs
Martin Nehez, Daniel Olejar, Michal Demetrian
2008-05-15
Combinatorics · Mathematics
The intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph
Patrick Bennett, Alan Frieze, Wesley Pegden
2024-11-08
Combinatorics · Mathematics
Packing edge disjoint cliques in graphs
József Balogh, Michael C. Wigal
2025-09-16
Combinatorics · Mathematics
Moderate deviations of triangle counts in sparse Erd\H{o}s-R\'enyi random graphs $G(n,m)$ and $G(n,p)$
José D. Alvarado, Leonardo Gonçalves de Oliveira, Simon Griffiths
2025-01-13
Probability · Mathematics
On some estimates for Erd\"os-R\`enyi random graph
Nikolay Kazimirow
2019-04-03
Combinatorics · Mathematics
Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
Jesús González, Bárbara Gutiérrez, Hugo Mas
2016-01-13
Combinatorics · Mathematics
Super-logarithmic cliques in dense inhomogeneous random graphs
Gweneth McKinley
2019-03-13
Probability · Mathematics
Cliques in rank-1 random graphs: the role of inhomogeneity
Kay Bogerd, Rui M. Castro, Remco van der Hofstad
2020-08-31
Combinatorics · Mathematics
Tight asymptotics of clique-chromatic numbers of dense random graphs
Yury Demidovich, Maksim Zhukovskii
2022-12-05
Combinatorics · Mathematics
Random cliques in random graphs revisited
Robert Morris, Oliver Riordan
2025-04-02
Data Structures and Algorithms · Computer Science
Finding Dense Subgraphs in G(n,1/2)
Atish Das Sarma, Amit Deshpande, Ravi Kannan
2008-09-22
Combinatorics · Mathematics
Finding cliques using few probes
Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz +1
2018-09-20
Combinatorics · Mathematics
Clique coloring of dense random graphs
Noga Alon, Michael Krivelevich
2017-11-07
Combinatorics · Mathematics
A limit theorem for small cliques in inhomogeneous random graphs
Jan Hladky, Christos Pelekis, Matas Sileikis
2021-11-16
Probability · Mathematics
The Erd\H{o}s-R\'enyi Random Graph Conditioned on Every Component Being a Clique
Martijn Gösgens, Lukas Lüchtrath, Elena Magnanini, Marc Noy +1
2025-03-19
Combinatorics · Mathematics
Clique structure and other network properties of the tensor product of Erd\H{o}s-R\'enyi graphs
Umit Islak, Bugra Incekara
2024-08-15
Combinatorics · Mathematics
Random walk hitting times and effective resistance in sparsely connected Erd\H{o}s-R\'enyi random graphs
John Sylvester
2020-12-22
Combinatorics · Mathematics
On the edge metric dimension for the random graph
Nina Zubrilina
2016-12-22
Number Theory · Mathematics
A random model for the Paley graph
Rudi Mrazović
2016-03-03
Probability · Mathematics
On the evolution of topology in dynamic clique complexes
Gugan Thoppe, D. Yogeshwaran, Robert Adler
2016-01-18
Combinatorics · Mathematics
Finding cliques and dense subgraphs using edge queries
Endre Csóka, András Pongrácz
2024-07-12
Combinatorics · Mathematics
Minimum-cost matching in a random graph with random costs
Alan Frieze, Tony Johansson
2015-11-19