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 By others on same topic  0 Discussions Create my own version
For p=n−2/3logn, the number X of copies of K4​ satisfies
EX=(4n​)p6∼24(logn)6​
(1)
and var(X)=o((EX)2). Two distinct copies have dependent indicators only when they share at least two vertices; pairs sharing two or three vertices contribute respectively O(n6p11) and O(n5p9) to the variance.

 Ancestors (8)

  1. Expected subgraph count in the Erdős-Rényi model
  2. Erdős-Rényi model
  3. Random graph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  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)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook