trianglefree24_graph
def
The cyclic digraph on 24 vertices with positive modular steps 1, 4, 5, 9, 13, 17 and 21.
Statement
def trianglefree24_graph : Digraph (Fin 24)- Source
- Explicit graph from experiments 12542 and 12544, for the triangle-free minimum-counterexample route in OP-110.
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 5
- trianglefree24_graph_two_vertex_deletions_strongDeleting any two vertices from the explicit 24-vertex digraph leaves it strongly connected; the two specified vertices may coincide.
- trianglefree24_graph_no_directed_trianglesThe explicit 24-vertex digraph contains no directed triangle.
- trianglefree24_graph_regular_orientedThe explicit 24-vertex digraph is loopless, oriented and 7-outregular.
- trianglefree24_graph_every_arc_dominatedEvery arc of the explicit 24-vertex digraph has a common in-neighbor.
- trianglefree24_graph_four_cyclesFour displayed pairwise disjoint four-vertex subsets of the explicit 24-vertex digraph are directed cycles.
Lean source view module on GitHub
def trianglefree24_graph : Digraph (Fin 24) := ⟨fun u v => ((v.val + 24 - u.val) % 24) ∈ ({1,4,5,9,13,17,21} : Finset ℕ)⟩