maxcut_nash_pivot_obstruction_graph
def
A six-vertex unweighted graph testing vertex extension under Nash stability.
Statement
def maxcut_nash_pivot_obstruction_graph : SimpleGraph (Fin 6)- Source
- Finite atlas enumeration in experiment 16715.
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 1
- maxcut_nash_extension_with_profitable_pivot_coalitionA best-responding one-conflict vertex can extend a strong deletion equilibrium to a Nash profile that is not strongly stable. A two-vertex…
Lean source view module on GitHub
def maxcut_nash_pivot_obstruction_graph : SimpleGraph (Fin 6) := SimpleGraph.fromRel (fun u v : Fin 6 => (u.val, v.val) ∈ [(0, 2), (1, 2), (1, 3), (1, 4), (2, 3), (2, 5), (3, 4), (3, 5), (4, 5)])