Lower tails for triangles inside the critical window

Matthew Jenssen, Will Perkins, Aditya Potukuchi +1

We study the probability that the random graph $G(n,p)$ is triangle-free. When $p=o(n^{-1/2})$ or $p=\omega (n^{-1/2})$ the asymptotics of the logarithm of this probability are known…