Mantel's Theorem for random graphs

Bobby DeMarco, Jeff Kahn

For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G)\ge b(G)$ for any $G$, and a classic result…