AFTD Auto-Formalizing Theoretical Domains

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

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]
See it in the graphDiscuss this resultChallenge it