maxcut_defect_one_dense_core_graph
def
The join of three disjoint four-vertex matchings.
Statement
def maxcut_defect_one_dense_core_graph : SimpleGraph (Fin 12)- Source
- Explicit dense-core example investigated in experiment 16301.
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 1
- maxcut_defect_one_dense_core_witnessA 12-vertex graph of minimum degree nine has a six-clique, a 1-defective 3-coloring, and a strong 3-color equilibrium.
Lean source view module on GitHub
def maxcut_defect_one_dense_core_graph : SimpleGraph (Fin 12) := SimpleGraph.fromRel (fun u v : Fin 12 => u.val / 4 ≠ v.val / 4 ∨ u.val / 2 = v.val / 2)