Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix 8.6 — the graph G1G_1G1​ is uncolourable

Proved
SnarkGen.Zhang.g1_not_colourable

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

counterexampleedge-colouringp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1snarks

Let G1G_1G1​ be the first graph of Appendix 8.6 (34 vertices, 51 edges, paper vertex iii renamed i−1i-1i−1). Then G1G_1G1​ is uncolourable: there is no map

c:E(G1)→{1,2,3}c : E(G_1) \to \{1,2,3\}c:E(G1​)→{1,2,3}

giving distinct colours to any two distinct edges that share an endpoint. In other words, the chromatic index of G1G_1G1​ is 444.

Uncolourability is the defining property of a snark and the hardest to certify by hand.

Formalization Note "Colourable" is G.lineGraph.Colorable 3, a proper 333-colouring of the line graph.

Preamble
import Mathlib
import Definitions.Def_SnarkGen_Zhang_g1
import Definitions.Def_SnarkGen_EdgeInsertion_Colourable
Formal statement
namespace SnarkGen.Zhang

theorem g1_not_colourable : ¬ SnarkGen.EdgeInsertion.Colourable g1 := by sorry

end SnarkGen.Zhang
Source
G. Brinkmann, J. Goedgebeur, J. Hägglund, K. Markström, Generation and properties of snarks, arXiv:1206.6690v3, p. 36, Appendix 8.6 (heading and first list); p. 4, Section 2 (definition of snark)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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