Claims

../

1982_12_01_rodl: Rödl (Combinatorica, 1982), as the site credits him, builds for every fixed epsilon > 0 a graph of infinite chromatic number whose n-vertex subgraphs become bipartite after deleting at most epsilon n edges; the paper is not held.

2026_09_03_adamczewski: GPT-6 Astra's disproof, published in Tom Adamczewski's Lean repository: for some divergent f, every graph whose n-vertex subgraphs become bipartite after f(n) edge deletions is 3-colorable; its Lean disproof was built here.

---