Triangle-free Ramsey lower bound by alteration
= Triangle-free Ramsey lower bound by alteration
{title2=$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-\binom n3p^3-\binom nt(1-p)^{\binom t2}$. 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.