Appendix 8.1 — the graph has girth at least 5
ProvedSnarkGen.OddFactors.g81_egirthcounterexamplegirthp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1snarks
Let be the 26-vertex graph of Appendix 8.1. Then contains no cycle of length 3 or 4; its girth satisfies
Girth at least 5 is one of the four conditions in the definition of a snark (Section 2), and 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.