Abstract

With ξξ the number of triangles in the usual (Erdős-Rényi) random graph G(m,p)G(m,p), p>1/mp>1/m and η>0η>0, we show (for some Cη>0C_η>0) $$\Pr(ξ> (1+η)\E ξ) < \exp[-C_η\min{m^2p^2\log(1/p),m^3p^3}].$$ This is tight up to the value of CηC_η.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.