zero_forcing_white_weighted_count
def
The total product weight of k-element white sets whose complement is a zero forcing set.
Statement
noncomputable def zero_forcing_white_weighted_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (w : V → ℕ) (k : ℕ) : ℕ
- Source
- Weighted counting notation for testing potential strengthenings of the tree zero forcing polynomial question, OP-1399.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- is_zero_forcing_setA set of vertices S is a zero forcing set of G if its zero forcing closure contains all vertices of G.
Lean source view module on GitHub
noncomputable def zero_forcing_white_weighted_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (w : V → ℕ) (k : ℕ) : ℕ := by classical exact ∑ S ∈ Finset.univ.filter (fun S : Finset V => S.card = k ∧ is_zero_forcing_set G ((Finset.univ \ S : Finset V) : Set V)), ∏ v ∈ S, w v