AFTD Auto-Formalizing Theoretical Domains

simple_graph_dominating_sets_containing

def

D_v(G): the dominating sets of G that contain v, where S dominates G when every vertex is in S or adjacent to a vertex of S.

Statement

def simple_graph_dominating_sets_containing {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : Finset (Finset V)
Defined in
arXiv:2610.11446 (On the local average order of dominating sets), Sec. 1 (dominating sets; D_v(G)).
Verified
09 Oct 2026
Axioms
none listed
Used by 11

Lean source view module on GitHub

/-- `𝒟_v(G)`: the dominating sets of `G` that contain the vertex `v` (a set `S` dominates `G` when every vertex is in `S` or adjacent to a vertex of `S`). -/
def simple_graph_dominating_sets_containing {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : Finset (Finset V) :=
  Finset.univ.filter (fun S => v ∈ S ∧ ∀ w, w ∈ S ∨ ∃ u ∈ S, G.Adj u w)
See it in the graphDiscuss this resultChallenge it