Claims

../

2026_06_26_ferudun: A June 2026 arXiv preprint asserts that for every n from 1 to 40 the most edges a triangle-free graph on 5n vertices needs deleted to become bipartite is exactly n squared; its certificates are not reviewed.

---