maxcut_fair9_colors
def
The nine-vertex three-color profile whose first color is zero and whose remaining colors are specified by eight arguments.
Statement
def maxcut_fair9_colors (a b c d e f g h : Fin 3) : Fin 9 → Fin 3- Source
- Related work: arXiv:2610.04948, Section 4, asks whether all unweighted Max-k-Cut games have a strong equilibrium; this finite obstruction to selecting a fair Nash equilibrium was discovered in experiment 12959 and independently checked in 12961, 12964 and 12973.
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 6
- maxcut_fair9_stable_exampleA specified three-color profile is a strong equilibrium of the nine-vertex graph.
- maxcut_fair9_nash_fairness_obstructionOn the specified nine-vertex three-color graph there is a singleton-stable profile with every utility at least four, no strong equilibrium…
- maxcut_fair9_witnessA specified three-color profile on the nine-vertex graph has utility at least four for every vertex and admits no profitable singleton…
- maxcut_fair9_no_maxmin_strong_nashOn the specified nine-vertex graph, no strong equilibrium has minimum utility at least that of every singleton-stable three-coloring.
- maxcut_fair9_normalized_certificatesFor every three-color profile on the nine-vertex graph whose first vertex has color zero, if all utilities are at least four and no…
- maxcut_fair9_no_strong_with_min_fourNo strong equilibrium of the nine-vertex graph with three colors gives every vertex utility at least four.
Lean source view module on GitHub
def maxcut_fair9_colors (a b c d e f g h : Fin 3) : Fin 9 → Fin 3 := ![0,a,b,c,d,e,f,g,h]