Poisson threshold for vertices lying in no triangle ($\left(\genfrac{}{}{0ex}{}{n-1}{2}\right)p^3=\log (n/c)⟹T\Rightarrow \mathrm{Po}(c)$)

For a fixed set of $r$ vertices, exclude all triangles meeting that set. Their total expectation is $r\log (n/c)+o(1)$. Distinct triangle pairs sharing an edge contribute $O_r(n^3{p}^5)=o(1)$ to the Janson dependency sum. Harris' inequality and Janson inequality bound the avoidance probability between matching exponentials, giving $(c/n{)}^r(1+o(1))$. The factorial-moment criterion for Poisson convergence then gives the displayed law.