Post-Cutoff

Science & mathOpenAI, McGill University and ETH Zurich96 days after June 2026

Linear Hadwiger conjecture proved

K_t-minor-free graphs are O(t)-colourable; proof found by GPT-6 Astra (Norin & Steiner), Lean-verified by Codex

Event confirmedAwaiting review

Importance: historic (5 of 5)

The takeaway

On Oct 4, 2026 Sergey Norin (McGill) and Raphael Steiner (ETH Zurich) posted arXiv 2610.05291, proving the linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is Ct-colourable.

Status
Claim

Event confirmedAwaiting review

Our reporting
High confidence
Verification
Lean proof, not yet reviewed
Importance
Historic (5 of 5)
Last verified
19 October 2026

Your AI and this story

  • GPT-6.2 Astra126 days after its cutoff
  • Claude Opus 5.596 days after its cutoff
  • Gemini 4 Hydrogen187 days after its cutoff
  • Grok 4.7126 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 96 days before it.

Key facts

  • Paper: ‘A Proof of the Linear Hadwiger Conjecture’, Sergey Norin and Raphael Steiner, arXiv 2610.05291 (math.CO), Oct 4, 2026
  • Result: ∃ C ∈ ℕ such that K_t-minor-free graphs are Ct-colourable (Hadwiger’s 1943 conjecture asks for t−1 colours; the linear version had been a major open weakening; best prior general bound was O(t log log t), Delcourt–Postle)
  • Disclosure: ‘The proof presented in this paper was developed by OpenAI’s ChatGPT model Astra 6, following research directions and feedback supplied by the authors. The authors suggested several possible approaches, but almost none of their specific proof ideas were retained in the final argument.’
  • Process: asked first for the very dense case (v(G) ≤ C′t), which the model proved ‘after only a couple of hours and some encouragement’; then an explicit dependence gave the conjecture for v(G) ≤ t(log t)^(1/2−o(1)); asked for ‘an original idea to bridge the gap’, it produced the bootstrap argument that closes it using Delcourt–Postle’s reduction
  • Ingredients: Reed–Seymour fractional linear Hadwiger, Delcourt–Postle reduction and chromatic separability, Pippenger–Frankl–Rödl matching theorem, LP duality, Liu–Luo-style contractions; the authors: the proof is ‘contained in the convex hull of existing results. Yet it does not lie on a low-dimensional face of it’
  • Lean 4: github.com/snorin239/LinearHadwiger formalizes Theorem 1 (plus Reed–Seymour, Theorem 4, Corollary 24), produced by ‘OpenAI Codex versions 6 Sol and Astra, following guidance from the paper’s authors’; no sorries, standard axioms only; release v0.1.0
  • Verification status: preprint + Lean-verified main theorem; not yet peer-reviewed
  • AI disclosure (abstract, arXiv 2610.05291): ‘The proof was found by GPT-6 Astra, following the directions by the authors.’

What happened

Hadwiger’s conjecture (1943) links graph minors and colouring; even its “linear” weakening, that O(t) colours suffice, resisted work by Reed, Seymour, Norin, Postle, Delcourt and others, whose best bounds were slightly superlinear. Norin, one of the field’s main contributors, and Steiner directed GPT-6 Astra toward what they saw as the missing dense case. The model solved it quickly and, when pushed for a new idea, found a bootstrap argument that finishes the proof. Codex then formalized the main theorem in Lean.

Why it matters

With the 3SUM/APSP refutation and the KLS proofs posted the same week, it marks a step change in AI-originated mathematics: famous problems now fall with proofs largely written by models and checked by machines. Original Hadwiger (t−1 colours) remains open. Reactions had not been found at 07:30 CEST on Oct 6.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationUnrefereed preprint by specialists (Norin, Steiner); main theorem formally verified in Lean 4 (no sorries, standard axioms; formal statement written with the authors, not independently audited)

Sources

2 sources from 2 sites. Numbers match the chips in the text.

2 sources: 2 primary

Primary

  1. arXiv 2610.05291: A Proof of the Linear Hadwiger Conjecturearxiv.org, paper
  2. GitHub: snorin239/LinearHadwiger (Lean 4 formalization)github.com, code

Changes

Status

Claim

Event confirmedAwaiting review

Our reporting
High confidence
Verification
Lean proof, not yet reviewed
Importance
Historic (5 of 5)
Last verified
19 October 2026

Sources at a glance

2 sources: 2 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
6 October 2026
Human review
None recorded for this entry. What the editor does
Version
Last saved 19 October 2026

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    October 2026: the arXiv stream of conjectures settled with disclosed AI help continues

    Awaiting review

  2. Science & math

    Claude discovers an algorithm that refutes the 3SUM and APSP hypotheses

    Event confirmedAwaiting review

  3. Model releases

    OpenAI releases GPT-6 Astra, its first GPT-6 model

    Confirmed

People in this story

Raphael Steiner, Mathematician, ETH Zurich; Sergey Norin, Mathematician, McGill University

The whole topic