digraph_overlap_sharp_eight_graph
def
The oriented graph on eight vertices obtained from the cyclic graph on seven vertices with steps 1, 2 and 4 by adding a sink with predecessors 0, 1 and 5.
Statement
def digraph_overlap_sharp_eight_graph : Digraph (Fin 8)- Source
- Explicit witness for the overlap collision-count route to OP-110; experiment 13163.
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 1
- digraph_overlap_sharp_eight_certificateThe displayed eight-vertex graph is loopless, oriented and arc-dominated; vertex 7 is a sink. Its only unordered pair of vertices with at…
Lean source view module on GitHub
def digraph_overlap_sharp_eight_graph : Digraph (Fin 8) := ⟨fun u v => (u.val < 7 ∧ v.val < 7 ∧ (v.val + 7 - u.val) % 7 ∈ ({1, 2, 4} : Finset ℕ)) ∨ ((u = 0 ∨ u = 1 ∨ u = 5) ∧ v = 7)⟩