Loading problem…
Status
On this page
Status
Topics
Status
On this page
Status
Topics
Can every triangle-free graph on vertices be made bipartite by deleting at most edges?
Source: erdosproblems.com/23
No claim settles this problem.
Falsifiable. The site's label is a note on an open problem
(Current assessment), not a claim; the frontmatter standing is derived from
the one claim page under claims/, Ferudun's finite-range claim
(claim page (Ferudun, 2026)),
which is partial and settles nothing for all .