Upper tails for trianglesAbstractWith the number of triangles in the usual (Erdos-R\'enyi) random graph G(m,p), p>1/m and η>0, we show (for some Cη>0) (> (1+η) ) < [-Cηm2p2(1/p),m3p3]. This is tight up to the value of Cη.0Discussion (0)Sign in to join the discussion.Loading comments…