zero_forcing_root_exposure_count
def
The number of k-element white vertex sets whose complement is zero forcing and whose root-exposed-fort status equals the given Boolean.
Statement
noncomputable def zero_forcing_root_exposure_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (r : V) (k : ℕ) (exposed : Bool) : ℕ
- Source
- Counts the rooted boundary states in the four-state recurrence towards OP-1399.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 2
- 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.
- zero_forcing_root_exposed_fortA white set W contains a root-exposed fort if it contains a set F not containing r such that r has a neighbor in F and every vertex other…
- Used by 1
- tree_exposure_plain_partial_sync_counterexampleFor a rooted three-vertex path the unexposed counts at ranks zero and one are one and three, while the exposed counts at ranks zero, one…
Lean source view module on GitHub
noncomputable def zero_forcing_root_exposure_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (r : V) (k : ℕ) (exposed : Bool) : ℕ := {W : Finset V | W.card = k ∧ is_zero_forcing_set G ((Finset.univ \ W : Finset V) : Set V) ∧ ((exposed = true) ↔ zero_forcing_root_exposed_fort G r W)}.ncard