Appendix 8.1 — the graph is cubic
ProvedSnarkGen.OddFactors.g81_isRegularOfDegree_threecounterexamplecubic-graphsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1snarks
Let be the 26-vertex graph of Appendix 8.1. Then is cubic:
Being cubic is the first of the properties that make a snark; it is asserted in the heading of Appendix 8.1.
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) is cubic: every vertex has exactly three neighbours. -/ theorem g81_isRegularOfDegree_three : G81.IsRegularOfDegree 3 := 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. 29, Appendix 8.1 (heading: A cubic graph where all 2-factors only consist of odd cycles)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.