circulant_1_3
def
The 4-regular circulant graph C_n(1,3) on vertex set ZMod n with connection set {1, -1, 3, -3}.
Statement
noncomputable def circulant_1_3 (n : ℕ) : SimpleGraph (ZMod n)
- Defined in
- arXiv:2610.41820 Section 1
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 1
- circulant_1_3_three_colorableFor every integer n ≥ 8, the circulant graph C_n(1,3) has a proper vertex 3-colouring, so N_3(C_n(1,3)) > 0.
Read back from the Lean
This declaration defines circulant_1_3, a function that takes a natural number $n$ and returns the simple graph on the vertex set $\mathbb{Z}/n\mathbb{Z}$ (ZMod n) given by the circulant graph (SimpleGraph.circulantGraph) with edge/connection set $\{1, -1, 3, -3\} \subseteq \mathbb{Z}/n\mathbb{Z}$. (This is a definition, not a theorem, so it makes no assertion.)
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The 4-regular circulant graph C_n(1,3) on ZMod n with jump set {1, -1, 3, -3}. -/ noncomputable def circulant_1_3 (n : ℕ) : SimpleGraph (ZMod n) := SimpleGraph.circulantGraph ({1, -1, 3, -3} : Set (ZMod n))