maxcut_anchor_neutral_pivot_graph
def
The known 91-vertex anchor graph with one extra edge from the first core vertex to a previously nonadjacent anchor of its displayed target color.
Statement
def maxcut_anchor_neutral_pivot_graph : SimpleGraph (Fin 16 ⊕ (Fin 3 × Fin 25))- Source
- Experiments 16812 and 16814.
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 1
- maxcut_anchor_three_graphThe 91-vertex graph G_3 of arXiv:2610.04948: a 16-vertex core A,B,C,D and three anchor classes of 25 vertices. Indices and colors are…
- Used by 2
- maxcut_anchor_neutral_pivot_initial_strongThe displayed initial profile is a strong equilibrium after the extra edge is added.
- maxcut_anchor_neutral_pivot_initial_optimalThe initial profile remains globally optimal after the extra edge is added.
Lean source view module on GitHub
def maxcut_anchor_neutral_pivot_graph : SimpleGraph (Fin 16 ⊕ (Fin 3 × Fin 25)) := SimpleGraph.fromRel (fun u v : (Fin 16 ⊕ (Fin 3 × Fin 25)) => maxcut_anchor_three_graph.Adj u v ∨ (u = (Sum.inl (0 : Fin 16) : (Fin 16 ⊕ (Fin 3 × Fin 25))) ∧ v = (Sum.inr ((2 : Fin 3), (24 : Fin 25)) : (Fin 16 ⊕ (Fin 3 × Fin 25)))))