Tight upper tail bounds for cliques
With ?k =? the number of copies of Kk in the usual (Erd?s-Rnyi) random graph G(n,p), p ? n-2/(k-1) and ? > 0, we show when k > 1
upper tails random graphs large deviations subgraph counts