Graph Problems: st Dom
ProvedGraphProblems.stDomalgorithmsanthropic-eth-16a5ce4complexity-theory
StDom: for the formula domF of a graph G, cntS n s is the number of dominating sets of G
with s vertices.
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_Interfaces import Definitions.Def_GraphProblems_Read import Definitions.Def_GraphProblems_Sets set_option autoImplicit false section section open GraphProblems open Groundwork Groundwork.Prog CountKSat Finset open Sets
Formal statement
theorem GraphProblems.stDom : StDom := by sorry
Source