is_total_forcing_set
def
A total forcing set is a zero forcing set that induces a subgraph with no isolated vertices.
Statement
def is_total_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_total_forcing_poly_eqFor every integer t ≥ 24, the total forcing polynomial of gt_graph t is equal to the zero forcing polynomial of gt_graph t.
- total_forcing_polyGiven a finite type V and a simple graph G on V, total_forcing_poly G is the polynomial in Polynomial ℕ defined as the sum over all…
Read back from the Lean
For a type V, a simple graph G on V, and a subset S of V, is_total_forcing_set G S asserts that:
1. S is a zero forcing set of G (is_zero_forcing_set G S, meaning every vertex v : V satisfies ZeroForced G S v), and
2. For every vertex v ∈ S, there exists a vertex w ∈ S such that v is adjacent to w in G (i.e., the subgraph induced by S has no isolated vertices).
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 subgraph with no isolated vertices. -/ def is_total_forcing_set {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop := is_zero_forcing_set G S ∧ ∀ v : S, ∃ w : S, G.Adj v.1 w.1