Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 122 / 1 / b

Let $X$ count the triangles of the binomial random graph $G(n,p)$. ThenTwo distinct triangle indicators are dependent only when the triangles share an edge. Hence their ordered Janson dependency sum is

If $0<p\le n^{-1/2}$, then $\Delta =O(\mu )$. The first Janson inequality givesFor the reverse bound, the events that individual triangles are absent are decreasing, so Harris' inequality giveswhere $p<1/2$ keeps the logarithmic estimate uniform. Thus the probability is $e^{-\Theta (p^3{n}^3)}$.

If $n^{-1/2}\le p<1/2$, the extended Janson bound givesFor a lower bound, fix a balanced bipartition of the vertices and require every edge inside either part to be absent. The resulting graph is bipartite, hence triangle-free, and this event has probabilityCombining the bounds proves the second regime.