Tweaking the constant in the Linear Hadwiger Theorem

Get email updates

David R. Wood

Every finite simple graph has chromatic number at most 1,118,430 times the order of its largest complete minor.

What was already known

Norin and Steiner proved that a universal factor exists and estimated their unoptimized factor to be on the order of 1010010^{100}. Wood’s first version gave an explicit factor of 19,885,160.

AI involvement AI-led

Wood asked Claude Opus 5.5 to optimize the Norin–Steiner proof. Claude found places to improve the constants, worked out the proof details and drafted the argument. GPT-6 reviewed it and suggested further changes. Wood contributed optimizations and revised the text.

Importance Modest

The second version lowers the explicit factor to 1,118,430.

Technical verification Formal (Lean)

Wood reports that Lean 4 and Mathlib checked the finite-graph bound with factor 1,118,430 using standard Lean axioms. The paper includes the matching theorem statement and makes the Lean files and numerical scripts available.

Formal checking

The cited project reports the check for these statements.

Checker
David R. Wood, reporting Lean 4 checks
Scope
Theorem 1.2 with explicit factor 1,118,430 for finite simple graphs, with the three standard axioms.
Basis
Reported by the linked checker

Human understanding Partial

Wood reports understanding the proof at a high level. He relies on automated checks for technical and numerical details he did not check by hand.

Correction and publication history