Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix 8.1 — the graph G8.1G_{8.1}G8.1​ has girth at least 5

Proved
SnarkGen.OddFactors.g81_egirth

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

counterexamplegirthp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1snarks

Let G8.1G_{8.1}G8.1​ be the 26-vertex graph of Appendix 8.1. Then G8.1G_{8.1}G8.1​ contains no cycle of length 3 or 4; its girth satisfies

g(G8.1)≥5.g(G_{8.1}) \ge 5.g(G8.1​)≥5.

Girth at least 5 is one of the four conditions in the definition of a snark (Section 2), and G8.1G_{8.1}G8.1​ must satisfy it to be a counterexample to Conjecture 4.11.

Formalization Note The girth is Mathlib's extended girth egirth : ℕ∞.

Preamble
import Mathlib
import Definitions.Def_SnarkGen_OddFactors_G81
Formal statement
namespace SnarkGen.OddFactors

/-- The graph `G₈.₁` of Appendix 8.1 (arXiv:1206.6690v3, p. 29) has girth at least 5: it has no
cycle of length 3 or 4 (the extended girth `egirth` is at least 5). -/
theorem g81_egirth : 5 ≤ G81.egirth := by sorry

end SnarkGen.OddFactors
Source
G. Brinkmann, J. Goedgebeur, J. Hägglund, K. Markström, Generation and properties of snarks, arXiv:1206.6690v3, p. 4, Section 2 (girth, snark); p. 11, Observation 4.12; p. 29, Appendix 8.1
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