Get access

Upper tails for triangles



With ξ the number of triangles in the usual (Erdős-Rényi) random graph G(m,p), p > 1/m and η > 0, we show (for some Cη > 0)

equation image

This is tight up to the value of Cη. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 452–459, 2012

Get access to the full text of this article