simple_graph_is_dominated
def
A vertex in a simple graph is dominated if there exists another vertex dominating it.
Statement
def simple_graph_is_dominated {V : Type*} (G : SimpleGraph V) (u : V) : Prop
- Defined in
- arXiv:2611.14430, Section 2
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- simple_graph_dominated_byA vertex $u$ is dominated by a distinct vertex $t$ in a simple graph $G$ if the closed neighborhood of $u$ is contained in the closed…
Read back from the Lean
Given a type V, a simple graph G on V, and a vertex u : V, simple_graph_is_dominated G u defines the proposition that there exists a vertex t : V such that u ≠ t and the closed neighborhood of u (i.e., insert u (G.neighborSet u)) is a subset of the closed neighborhood of t (i.e., insert t (G.neighborSet t)).
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 vertex is dominated if some distinct vertex dominates it. -/ def simple_graph_is_dominated {V : Type*} (G : SimpleGraph V) (u : V) : Prop := ∃ t : V, simple_graph_dominated_by G u t