Tight upper tail bounds for cliques
Tight upper tail bounds for cliques
Abstract With ξ k =ξ the number of copies of K k in the usual (Erdős‐Rényi) random graph G ( n , p ), p ≥ n ‐2/( k ‐1) and η > 0, we show when k > 1 This is tight up to the value of the constant …