is_connected_forcing_set
def
A connected forcing set is a zero forcing set that induces a connected subgraph.
Statement
def is_connected_forcing_set {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop
- Defined in
- arXiv:2611.11352 Section 1
- Verified
- 10 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.
- Used by 2
- 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.
- connected_forcing_polyGiven 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…
Read back from the Lean
For a simple graph G on vertex type V and a subset of vertices S : Set V, is_connected_forcing_set G S asserts that S is a zero forcing set of G (is_zero_forcing_set G S) and the induced subgraph G.induce S is connected ((G.induce S).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
/-- A zero forcing set that induces a connected subgraph. -/ def is_connected_forcing_set {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop := is_zero_forcing_set G S ∧ (G.induce S).Connected