What was already known
Earlier list-coloring bounds for Kₜ-minor-free graphs retained logarithmic factors; a linear fractional-coloring bound did not imply this list-coloring result.
AI involvement
OpenAI credits an internal model with the manuscript and proof. No named human proof checker or explanation is documented.
The cited release credits an internal OpenAI model with producing the result and the manuscript credits OpenAI as author; the record does not establish model autonomy from task selection or human direction.
Importance
It removes the remaining logarithmic factor from the general list-coloring bound.
Limitations
The released Lean challenge and solution modules do not include a located completed build or Comparator outcome. The result is not the coefficient-one Hadwiger conjecture.
Technical verification
The registry reports a Lean check of the main theorem through the Comparator challenge and separate solution module. The cited sources contain both modules and the configuration, but no completed build, kernel replay or Comparator outcome was found, and the result is absent from the formalization catalogue. The reported method is recorded; the evidence does not yet establish the scope or completion required for a higher rating. No completed human proof review is documented.
Human understanding
No named person explains the central argument in the reviewed sources. Few is the evidence default, not a finding that people cannot understand it.
Correction and publication history
If correct, it removes the remaining logarithmic factor from the general list-coloring bound.
Read this published revision