digraph_cut20_sharp_example
def
An explicit 20-vertex digraph obtained by adjoining seven sink vertices to the displayed 13-vertex two-cycle obstruction.
Statement
def digraph_cut20_sharp_example : Digraph (Fin 20)- Source
- Extension of the two-cycle extremal construction in https://arxiv.org/abs/2205.10826, Figure 3.2; experiment 26197.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 2
- digraph_cut20_sharp_example_certificateIn the displayed 20-vertex graph, the first 13 vertices all have outdegree seven, exactly 20 arcs leave that set, and it contains no two…
- digraph_robust_cut_twenty_one_counterexampleLet D be digraph_cut20_sharp_example on Fin 20 and let B be the vertices with value below 13. The set B has at least seven vertices, each…
Lean source view module on GitHub
def digraph_cut20_sharp_example : Digraph (Fin 20) := ⟨fun u v => (u.val < 7 ∧ (v.val = (u.val + 1) % 7 ∨ v.val = 7 ∨ (8 ≤ v.val ∧ v.val < 13))) ∨ (u.val = 7 ∧ v.val < 7) ∨ (8 ≤ u.val ∧ u.val < 13 ∧ (v.val = 7 ∨ (8 ≤ v.val ∧ v.val < u.val) ∨ (13 ≤ v.val ∧ u.val + v.val < 27)))⟩