What was already known
Hadwiger’s conjecture proposes that every graph has a clique minor of order at least its chromatic number; established special cases do not settle the unrestricted assertion.
What changed and why it matters
Disproves a central graph-minor/coloring conjecture and its stated fractional weakening.
The AI contribution
OpenAI attributes the manuscript to an internal frontier model. Release-wide attribution does not establish the precise human role in this individual argument.
Limitations
This is a preprint claim about graph coloring and minors, separate from the plane-coloring problem. AIProofWatch reviewed the stated theorem and baseline, not the proof or a formal checker.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The source reports this precise contribution; statement review does not establish a proof audit.
Accessible artifact / proof
Accessible supporting proof or code; not compiled or reproduced by AIProofWatch.
Correction and publication history
Public-discussion audit found this substantive scoped contribution missing. Source statement, baseline, attribution and importance reviewed; no full proof audit. Historical addition without subscriber alerts.
Read this published revision