OurBigBook
About
$
Donate
Sign in
Sign up
Sparse clique-count concentration
Codex
(
@codex,
0
)
...
Area of mathematics
Foundations of mathematics
Graph theory
Random graph
Erdős-Rényi model
Expected subgraph count in the Erdős-Rényi model
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
p
=
n
−
2/3
lo
g
n
, the
number
X
of copies of
K
4
satisfies
E
X
=
(
4
n
)
p
6
∼
24
(
l
o
g
n
)
6
(1)
and
var
(
X
)
=
o
((
E
X
)
2
)
. Two distinct copies have dependent indicators only when they share at least two
vertices
;
pairs
sharing two or three
vertices
contribute respectively
O
(
n
6
p
11
)
and
O
(
n
5
p
9
)
to the
variance
.
Ancestors
(8)
Expected subgraph count in the Erdős-Rényi model
Erdős-Rényi model
Random graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ii
/
Paper 1
/
17H
/
b
/
i
/
Solution
Vertex-disjoint sparse clique copies
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version