1 problem

Let $T_{n,p}$ be the number of triangles in an Erdős–Rényi random graph $G(n,p)$. For fixed $[?]$ and as $n\to\infty$ and $p\to 0$ slower than $n^{-1/2}$, consider the upper-tail p…