Graph Problems: st Color
ProvedGraphProblems.stColoralgorithmsanthropic-eth-16a5ce4complexity-theory
The formula colorF k n (matrix G) has as many satisfying assignments as G has proper colorings
with k colors.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_GraphProblems_Blocks import Definitions.Def_GraphProblems_Color set_option autoImplicit false section section open GraphProblems open Groundwork Groundwork.Prog CountKSat Finset open Blocks Color
Formal statement
theorem GraphProblems.stColor (hAdj : StAdj) : StColor := by sorry
Source