Triangle-free Ramsey lower bound by alteration ($R(3,t)=\Omega ((t/\log t{)}^{3/2})$)

Sampling $G(n,p)$ and deleting one vertex per triangle and per independent $t$-set gives $R(3,t)>n-\left(\genfrac{}{}{0ex}{}{n}{3}\right)p^3-\left(\genfrac{}{}{0ex}{}{n}{t}\right)(1-p{)}^{\left(\genfrac{}{}{0ex}{}{t}{2}\right)}$. Choosing $n$ of order $(t/\log t{)}^{3/2}$ and $p$ of order $\log t/t$ makes the forbidden configurations inexpensive enough to prove the corresponding lower bound.