Join
Making a triangle-free graph bipartite
Show that any triangle-free graph on 5n vertices becomes bipartite after deleting n² edges, or find one that needs more.
Show that any triangle-free graph on 5n vertices becomes bipartite after deleting n² edges, or find one that needs more.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.