加入
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.
Update from the catalog #1
已合并
Show that any triangle-free graph on 5n vertices becomes bipartite after deleting n² edges, or find one that needs more.