Hadwiger's conjecture is false
ProvedOAI.HadwigerCounterexample.not_hadwiger_conjecturecounterexamplegraph-theoryhadwiger
The headline consequence announced in the abstract of the source preprint: Hadwiger's conjecture is false. Writing for the Hadwiger number and for the chromatic number, the conjecture asserts for every finite simple graph; this theorem negates that universal statement:
It follows from the counterexamples of Corollary 1.2, where . The chromatic number is compared as an extended natural number (ℕ∞) against the natural Hadwiger number coerced to ℕ∞.
Formalization Note. Transcribed verbatim from the authors' Lean theorem OAI.HadwigerCounterexample.not_hadwiger_conjecture (Main.lean).
Preamble
import Mathlib import Definitions.Def_ListHadwiger open OAI.LinearListHadwiger
Formal statement
namespace OAI.HadwigerCounterexample
theorem not_hadwiger_conjecture :
¬ (∀ (m : ℕ) (G : SimpleGraph (Fin m)),
G.chromaticNumber ≤ ↑(hadwigerNumber G)) := by sorry
end OAI.HadwigerCounterexampleSource
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.