maxcut_unsafe_pivot_stable_graph
def
A six-vertex graph testing whether neutral pivot safety is necessary for a strong extension.
Statement
def maxcut_unsafe_pivot_stable_graph : SimpleGraph (Fin 6)- Source
- Experiments 16728 and 16729.
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 1
- maxcut_neutral_pivot_safe_not_necessaryA full graph and its vertex deletion may both be strongly stable, with exactly one restored-vertex conflict, while that conflict neighbor…
Lean source view module on GitHub
def maxcut_unsafe_pivot_stable_graph : SimpleGraph (Fin 6) := SimpleGraph.fromRel (fun u v : Fin 6 => (u.val, v.val) ∈ [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (1, 5), (2, 3), (2, 5), (4, 5)])