graph_11
The 11-vertex simple graph G_11 on Fin 11 consisting of a base 4-cycle 0-1-2-3-0, four caps 4, 5, 6, 7 adjacent to consecutive base pairs, two links 8 and 9 adjacent to pairs of caps (4,6) and (5,7) respectively, and a hub 10 adjacent to all four caps and both links.
Statement
def graph_11 : SimpleGraph (Fin 11)- Defined in
- arXiv:2610.39430 Definition 3.1
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 5
- graph_11_mutual_visibility_chromatic_number_eq_threeThe simple graph G_11 has mutual-visibility chromatic number 3, chromatic number 3, and diameter 2.
- graph_11_chromatic_numberThe chromatic number of the simple graph G_11 equals 3.
- graph_11_diamThe simple graph G_11 has diameter 2.
- graph_11_not_is_mutual_visibility_colorable_twoThe simple graph G_11 is not mutual-visibility 2-colorable.
- exists_diameter_two_graph_mutual_visibility_chromatic_number_threeThere exists a finite connected simple graph G of diameter 2 such that the mutual-visibility chromatic number of G equals 3 and the…
Read back from the Lean
Definition of graph_11, a simple graph on the vertex set Fin 11 (the integers 0 through 10) constructed via SimpleGraph.fromRel from the relation where directed edges run from:
- 0 to 1, 1 to 2, 2 to 3, and 3 to 0;
- 4 to 0 and 1;
- 5 to 1 and 2;
- 6 to 2 and 3;
- 7 to 3 and 0;
- 8 to 4 and 6;
- 9 to 5 and 7;
- 10 to 4, 5, 6, 7, 8, and 9.
Under SimpleGraph.fromRel, this yields the undirected simple graph on vertices {0, 1, ..., 10} with edges between two distinct vertices if and only if one of these pairs connects them in either direction.
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 11-vertex simple graph G_11 with base cycle, four caps, two links and a hub. -/ def graph_11 : SimpleGraph (Fin 11) := SimpleGraph.fromRel fun u v => (u = 0 ∧ v = 1) ∨ (u = 1 ∧ v = 2) ∨ (u = 2 ∧ v = 3) ∨ (u = 3 ∧ v = 0) ∨ (u = 4 ∧ (v = 0 ∨ v = 1)) ∨ (u = 5 ∧ (v = 1 ∨ v = 2)) ∨ (u = 6 ∧ (v = 2 ∨ v = 3)) ∨ (u = 7 ∧ (v = 3 ∨ v = 0)) ∨ (u = 8 ∧ (v = 4 ∨ v = 6)) ∨ (u = 9 ∧ (v = 5 ∨ v = 7)) ∨ (u = 10 ∧ (v = 4 ∨ v = 5 ∨ v = 6 ∨ v = 7 ∨ v = 8 ∨ v = 9))