Bipartite cuts in Ramsey-Turán style

József Balogh, Ce Chen, Bernard Lidický

We prove that every $K_5$-free $n$-vertex graph with sublinear independence number can be made bipartite by removing at most $n^2(1/18+o(1))$ edges, where the constant $1/18$ is be…