Appendix 8.6 — the graph is cubic
ProvedSnarkGen.Zhang.g1_isRegularOfDegree_threecounterexamplecubic-graphsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1snarks
Let be the first graph of Appendix 8.6 (34 vertices, 51 edges, decoded from the printed list of higher-numbered neighbours, with the paper's vertex renamed ). Then is cubic: every vertex has exactly three neighbours,
This is the first of the properties that make a snark, and it also certifies that the decoding of the printed list is consistent.
Preamble
import Mathlib import Definitions.Def_SnarkGen_Zhang_g1
Formal statement
namespace SnarkGen.Zhang theorem g1_isRegularOfDegree_three : g1.IsRegularOfDegree 3 := 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.