digraph_oriented_cut20_sharp_example
def
The explicit oriented 26-vertex graph with five low vertices, a target, a directed seven-cycle, seven acyclic high vertices and six sinks.
Statement
def digraph_oriented_cut20_sharp_example : Digraph (Fin 26)- Source
- Explicit construction from experiment 26321.
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 4
- digraph_oriented_cut20_sharp_example_certificateThe explicit oriented example has a seven-outregular twenty-vertex part with twenty outgoing arcs and no two disjoint cycles; every…
- digraph_oriented_regular_cut20_extension_certificateThe extended example is oriented, seven-outregular, arc-dominated and strongly connected, with a twenty-vertex part of cut twenty and no…
- digraph_oriented_robust_cut_twenty_one_counterexampleLet D be digraph_oriented_cut20_sharp_example on Fin 26 and B the set of vertices with value less than 20. D is oriented; B has at least…
- digraph_oriented_cut20_dominated_extension_certificateThe extended example is oriented, strongly connected, has minimum outdegree seven, a seven-outregular twenty-vertex part with cut twenty…
Lean source view module on GitHub
def digraph_oriented_cut20_sharp_example : Digraph (Fin 26) := ⟨fun u v => (u.val < 5 ∧ (v.val < u.val ∨ v.val = 5 ∨ (20 ≤ v.val ∧ u.val + v.val < 26))) ∨ (u.val = 5 ∧ 13 ≤ v.val ∧ v.val < 20) ∨ (6 ≤ u.val ∧ u.val < 13 ∧ (v.val < 6 ∨ v.val = 6 + (u.val - 6 + 1) % 7)) ∨ (13 ≤ u.val ∧ u.val < 20 ∧ ((13 ≤ v.val ∧ v.val < u.val) ∨ (6 ≤ v.val ∧ u.val + v.val < 26)))⟩