Balanced bipartite distance of $K_4$-free graphs

Abstract

We show that every $K_4$-free graph on $n$ vertices can be made balanced bipartite by removing at most $\frac{n^2}{9}$ edges. This proves a conjecture of Balogh, Clemen, and Lidick\'{y}, and generalizes both Sudakov's result on the bipartite distance of $K_4$-free graphs and Reiher's result on the sparse half of $K_4$-free graphs.