What was already known
The previous general correspondence-coloring bound for fixed forbidden clique retained a log log Δ factor. Alon, Krivelevich, and Sudakov conjectured the Δ/log Δ order for ordinary coloring under fixed-subgraph exclusion.
AI involvement
OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.
OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.
Importance
Resolves that coloring conjecture in the stronger correspondence-coloring setting.
Limitations
The implicit constant depends on fixed r and Δ must be sufficiently large. The linked Lean scope gives an independent-set bound, not the correspondence-coloring theorem.
Technical verification
Reported is the default when evidence for a higher level is insufficient. The OpenAI-authored manuscript reports and argues the result, but the reviewed sources do not document a completed check of the full assessed claim.
Human understanding
Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.
Correction and publication history
Primary manuscript, attribution, prior-work, and Lean-scope mismatch review for non-notifying local inclusion.
Read this published revision