connected_forcing_poly
Given a finite type V and a simple graph G on V, connected_forcing_poly G is the polynomial in Polynomial ℕ defined as the sum over all subsets S : Finset V of (if is_connected_forcing_set G (S : Set V) then Polynomial.X ^ S.card else 0).
Statement
noncomputable def connected_forcing_poly {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℕ
- Defined in
- arXiv:2611.11352 Section 1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- is_connected_forcing_setA connected forcing set is a zero forcing set that induces a connected subgraph.
- Used by 1
- gt_connected_forcing_poly_eqFor every integer t ≥ 24, the connected forcing polynomial of gt_graph t is equal to the zero forcing polynomial of gt_graph t.
Read back from the Lean
For a finite type V and a simple graph G on V, connected_forcing_poly G is the polynomial with coefficients in ℕ defined as the sum over all subsets S : Finset V of Polynomial.X ^ S.card if S is a connected forcing set of G, and 0 otherwise. Here, a subset S is a connected forcing set if: (1) S is a zero forcing set of G (every vertex in V can be zero-forced starting from S), and (2) the induced subgraph G.induce S is connected.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Connected forcing polynomial of a graph. -/ noncomputable def connected_forcing_poly {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℕ := open scoped Classical in ∑ S : Finset V, if is_connected_forcing_set G (S : Set V) then Polynomial.X ^ S.card else 0