With ξk=ξkn,p the number of copies of Kk in the usual
(Erd\H{o}s-R'enyi) random graph G(n,p), p≥n−2/(k−1) and η>0,
we show when k>1Pr(ξk>(1+η)\Eξk)<exp[−\gOη,kmin{n2pk−1log(1/p),nkp(2k)}]. This is tight up to the
value of the constant in the exponent.