Upper Tails for Cliques

Abstract

With k=kn,p the number of copies of Kk in the usual (Erdos-R\'enyi) random graph G(n,p), p≥ n-2/(k-1) and η>0, we show when k>1 (k> (1+η) k) < [-η,k \n2pk-1(1/p), nkpk2\]. This is tight up to the value of the constant in the exponent.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…