Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — arbitrarily large α≤2\alpha\le2α≤2 graphs with small connected matchings

Proved
OAI.HadwigerCounterexample.exists_graphs

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

counterexamplegraph-theoryhadwiger

This is the main result of the source preprint (Theorem 1.1, p. 3). There are arbitrarily large integers mmm for which an mmm-vertex finite simple graph GGG satisfies

α(G)≤2andcm(G)<m100,\alpha(G)\le2\quad\text{and}\quad \mathrm{cm}(G)<\frac{m}{100},α(G)≤2andcm(G)<100m​,

where α(G)\alpha(G)α(G) is the independence number and cm(G)\mathrm{cm}(G)cm(G) is the connected-matching number (the largest size of a matching whose edges are pairwise touching). Precisely, for every bound MMM there is an m≥max⁡(M,5)m\ge\max(M,5)m≥max(M,5) and a graph GGG on mmm vertices with these properties.

Combined with the matching–minor bound (Proposition 3.5), this forces the Hadwiger number below m/2m/2m/2 while the chromatic number is at least m/2m/2m/2, disproving Hadwiger's conjecture. The graphs are produced by a probabilistic frame construction over F2\mathbb F_2F2​; the constant 1/1001/1001/100 is the paper's fixed linear coefficient.

Formalization Note. Transcribed from the authors' Lean theorem OAI.HadwigerCounterexample.exists_graphs (Main.lean). Graphs are SimpleGraph (Fin m); α\alphaα is indepNum (an ℕ∞); cm\mathrm{cm}cm is the natural-valued connectedMatchingNumber, cast to ℚ for the strict inequality. The lower bound m≥5m\ge5m≥5 ensures nonemptiness and matches the authors' statement.

Preamble
import Mathlib
import Definitions.Def_HadwigerMatching_Defs
import Definitions.Def_ListHadwiger

open OAI.HadwigerMatching OAI.LinearListHadwiger
Formal statement
namespace OAI.HadwigerCounterexample

theorem exists_graphs (M : ℕ) : ∃ m : ℕ, max M 5 ≤ m ∧
    ∃ G : SimpleGraph (Fin m), G.indepNum ≤ 2 ∧
      (connectedMatchingNumber G : ℚ) < (m : ℚ) / 100 := by sorry

end OAI.HadwigerCounterexample
Source
https://github.com/openai/math/blob/main/preprints/A-counterexample-to-Hadwigers-conjecture-September-23-2026/paper.pdf , p. 3, Theorem 1.1; authors' Lean: https://github.com/openai/math/blob/main/lean/OAI/Combinatorics/HadwigerCounterexample/Main.lean
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me