zero_forcing_complements_three_extendible
def
The complements of zero forcing sets form a three-extendible independence system.
Statement
def zero_forcing_complements_three_extendible {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Prop
- Source
- A natural strengthening of the exchange condition considered for 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
def zero_forcing_complements_three_extendible {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Prop := ∀ A B : Finset V, A ⊆ B → is_zero_forcing_set G ((Finset.univ \ A : Finset V) : Set V) → is_zero_forcing_set G ((Finset.univ \ B : Finset V) : Set V) → ∀ x : V, x ∉ B → is_zero_forcing_set G ((Finset.univ \ insert x A : Finset V) : Set V) → ∃ R : Finset V, R ⊆ B \ A ∧ R.card ≤ 3 ∧ is_zero_forcing_set G ((Finset.univ \ insert x (B \ R) : Finset V) : Set V)