AFTD Auto-Formalizing Theoretical Domains

ve_dominates_inside

def

A vertex set S ve-dominates inside a vertex set A if every edge of G with both endpoints in A is ve-dominated by a vertex of S.

Statement

def ve_dominates_inside {V : Type*} (G : SimpleGraph V) (S : Set V) (A : Set V) : Prop
Source
step towards not_is_fix_v0_of_neighbors_unreachable
Verified
21 Oct 2026
Axioms
none listed
Used by 1
  • pend_ve_numa_C is the minimum cardinality of a vertex set A' contained in the component part C such that A' together with v ve-dominates the induced…

Lean source view module on GitHub

/-- `S` ve-dominates every edge whose two endpoints lie in `A`; with `A = univ` this is `is_ve_dominating G S`. -/
def ve_dominates_inside {V : Type*} (G : SimpleGraph V) (S : Set V) (A : Set V) : Prop := ∀ ⦃x y : V⦄, G.Adj x y → x ∈ A → y ∈ A → ∃ u ∈ S, u = x ∨ G.Adj u x ∨ u = y ∨ G.Adj u y
See it in the graphDiscuss this resultChallenge it