Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.5 — the matching–minor bound

Proved
OAI.HadwigerMatching.full_matching_minor_proposition

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

graph-theoryhadwigermatchingminor

Proposition 3.5 of the source preprint (p. 15). For every finite nonempty graph GGG of order mmm, with Hadwiger number h(G)h(G)h(G) and connected-matching number cm(G)\mathrm{cm}(G)cm(G),

h(G)≤m+4 cm(G)+23.h(G)\le\frac{m+4\,\mathrm{cm}(G)+2}{3}.h(G)≤3m+4cm(G)+2​.

In particular, if α(G)≤2\alpha(G)\le2α(G)≤2, cm(G)<m/100\mathrm{cm}(G)<m/100cm(G)<m/100 and m≥5m\ge5m≥5, then

h(G)<26m75+23<m2≤χ(G).h(G)<\frac{26m}{75}+\frac23<\frac m2\le\chi(G).h(G)<7526m​+32​<2m​≤χ(G).

The bound counts small branch sets in a complete-minor model: the singleton branches form a clique and can be paired, and together with the two-vertex branches they form one touching matching, which controls the deficit. This is the counting inequality that converts the connected-matching bound of Theorem 1.1 into a clique-minor estimate, following the connected-matching approach of Cambie.

Formalization Note. Transcribed verbatim from the authors' Lean theorem OAI.HadwigerMatching.full_matching_minor_proposition (HadwigerMatching/Main.lean). The order mmm, Hadwiger number hhh and connected-matching number ccc are introduced as let-bindings; inequalities are over ℚ; χ\chiχ is represented by chromaticNumber.toNat (finite on a finite graph).

Preamble
import Mathlib
import Definitions.Def_HadwigerMatching_Defs
import Definitions.Def_ListHadwiger

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

theorem full_matching_minor_proposition
    (V : Type) [Fintype V] [Nonempty V] (G : SimpleGraph V) :
    let m : ℕ := Fintype.card V
    let h : ℕ := LinearListHadwiger.hadwigerNumber G
    let c : ℕ := HadwigerMatching.connectedMatchingNumber G
    (h : ℚ) ≤ ((m : ℚ) + 4 * (c : ℚ) + 2) / 3 ∧
      (G.indepNum ≤ 2 →
        (c : ℚ) < (m : ℚ) / 100 →
        5 ≤ m →
        (h : ℚ) < 26 * (m : ℚ) / 75 + 2 / 3 ∧
        26 * (m : ℚ) / 75 + 2 / 3 < (m : ℚ) / 2 ∧
        (m : ℚ) / 2 ≤ (G.chromaticNumber.toNat : ℚ)) := by sorry

end OAI.HadwigerMatching
Source
https://github.com/openai/math/blob/main/preprints/A-counterexample-to-Hadwigers-conjecture-September-23-2026/paper.pdf , p. 15, Proposition 3.5; authors' Lean: https://github.com/openai/math/blob/main/lean/OAI/Combinatorics/HadwigerMatching/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