Minimal number of edges removed to make a graph triangle free

656 Views Asked by At

I'm interested in finding an upper bound on the expected value of the minimal number of edges one needs to remove from a random graph $G_{n,p}$ (where each edge appears with probability $p$) in order to make it triangle free. Particularly, I would really be happy if it was of size less than $\Theta(pn^2)$. Has anyone came across something like this?