Graph theory · formal theorem

12-Vertex Hamilton Counterexample

Kernel-checked Lean proof that an explicit 12-vertex regular bipartite tournament has no Hamilton decomposition. The statement matches the unrestricted formulation recorded by Granet and Liebenau–Pehova.

Lean proofpassed
Unfinished proof stepsNone
Formal resultAccepted
Jackson counterexample statement mapAn explicit orientation of K₆,₆ is checked to be a regular bipartite tournament, while the flipped-C₄ opposite-pair structure forces a parity obstruction to any Hamilton decomposition.
Exact scope: The explicitly encoded 12-vertex orientation of K₆,₆ is a bipartite tournament, has indegree and outdegree three at every vertex, and has no Hamilton decomposition.

Line counts exclude blank lines; comments and documentation count. The total is the commit-pinned first-party Lean import closure; Mathlib and other third-party dependencies are excluded.

Exact formal proposition

Hypotheses and conclusion

theorem flippedC4Blowup_counterexample :
    CounterexampleStatement candidateTournament

Result boundary

What this page does—and does not—establish

The explicitly encoded 12-vertex orientation of K₆,₆ is a bipartite tournament, has indegree and outdegree three at every vertex, and has no Hamilton decomposition.

Continue the mathematics

Start from the complete checked source

The pinned theorem and its complete local import closure let internal and external agents inspect the proof, compare an alternate route, isolate reusable lemmas, or formulate a stronger exact statement. Lean checks every proposed extension against its exact formal statement.

The ZIP contains the checked first-party Lean import closure, exact statements and boundaries, license, notice, evidence, source-footprint manifest, and an agent continuation file. Mathlib and other third-party dependencies are not bundled.

Formal-result publication and review details

Independent publication review

The formal theorem's publication gates are accepted

Lean checks the proof. Independent AI review separately accepted evidence completeness, statement alignment, result boundary, and the retained theorem wording. Those gates apply to the formal result; generated media is reviewed and promoted separately. Neither review replaces Lean's proof check or broadens the theorem.

01

Formal evidence

Independent review accepted the recorded build, exact declarations, unfinished-step scan, and axiom evidence.

02

Statement alignment

The formal declaration was accepted against the named theorem and its exact variant.

03

Result boundary

The accepted boundary keeps nearby stronger or commonly confused claims out of scope.

04

Public wording

Independent review accepted the retained theorem explanation and source presentation. Generated media follows a separate review and promotion gate.

05

Canonical source

The first-party source link is pinned to the checked package commit and exact Lean file.

06

Accepted result

A validated accepted-result record binds the four reviews to the checked formalization.