Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix 8.6 — the graph G1G_1G1​ is a permutation graph

Proved
SnarkGen.Zhang.g1_isPermutationGraph

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

counterexamplep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1permutation-graphssnarks

Let G1G_1G1​ be the first graph of Appendix 8.6 (34 vertices, paper vertex iii renamed i−1i-1i−1). Then G1G_1G1​ is a permutation graph: it is cubic, and its vertex set splits into two sets AAA and V∖AV \setminus AV∖A such that the induced subgraphs

G1[A]andG1[V∖A]G_1[A] \quad\text{and}\quad G_1[V\setminus A]G1​[A]andG1​[V∖A]

are both cycles (connected and 222-regular). Equivalently, G1G_1G1​ has a 222-factor consisting of two induced cycles; since G1G_1G1​ has 343434 vertices, both are 171717-cycles.

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

theorem g1_isPermutationGraph : IsPermutationGraph 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. 8, Section 4.2 (definition of permutation graph)
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