The manuscript reports arbitrarily large finite simple graphs with independence number at most two and chromatic number greater than their largest clique-minor order.
1 record · How we rate progress
The manuscript reports arbitrarily large finite simple graphs with independence number at most two and chromatic number greater than their largest clique-minor order. It also claims violation of the ordinary fractional-coloring weakening.
Original report: 2026-10-06The manuscript reports arbitrarily large finite simple graphs with independence number at most two and chromatic number greater than their largest clique-minor order. It also claims violation of the ordinary fractional-coloring weakening.
If correct, disproves a central graph-minor/coloring conjecture and its stated fractional weakening.
A sourced result with the exact hypotheses, baseline, and AI role stated; verification is assessed separately.
Background review: 2026-10-11. Selected sources:
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
