c7_box_k3_graph
def
The graph C_7 (box) C_3 = C_21(1,7) on Z/7 x {0,1,2}: u and v are adjacent iff they are distinct and c7_box_k3_distance u v = 1.
Statement
def c7_box_k3_graph : SimpleGraph (ZMod 7 × Fin 3)- Source
- step towards not_forall_power_well_covered_diam_le_three_and_twin_free_bounded
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Built on 2
- c7_box_k3_distanceThe product distance on Z/7 x {0,1,2}: c7_box_k3_distance u v = (cyclic distance of the first coordinates) + (0 if the second coordinates…
- cyclic_distance_sevenThe cyclic distance on Z/7: cyclic_distance_seven a b = min of the two residues (b-a) and (a-b), i.e. the graph distance in the cycle C_7.
- Used by 1
- c7_box_k3_graph_decidable_adjAdjacency in C_7 (box) C_3 is decidable, since it is a Boolean condition on c7_box_k3_distance.
Lean source view module on GitHub
/-- The box product `C_7 □ C_3` on `ZMod 7 × Fin 3`, equivalently the circulant `C_21(1,7)`. -/ def c7_box_k3_graph : SimpleGraph (ZMod 7 × Fin 3) where Adj u v := u ≠ v ∧ c7_box_k3_distance u v = 1 symm := ⟨fun u v h => ⟨h.1.symm, by have hc : c7_box_k3_distance v u = c7_box_k3_distance u v := by simp only [c7_box_k3_distance, cyclic_distance_seven, min_comm, eq_comm] rw [hc]; exact h.2⟩⟩ loopless := ⟨fun u h => h.1 rfl⟩