simple_graph_external_boundary
def
The external vertex boundary of a vertex set S in a graph G is the set of all vertices outside S adjacent to at least one vertex in S.
Statement
def simple_graph_external_boundary {V : Type*} (G : SimpleGraph V) (S : Set V) : Set V
- Defined in
- arXiv:2610.24059
- Verified
- 27 Oct 2026
- Axioms
- none listed
Read back from the Lean
For a type V, a simple graph G on V, and a subset of vertices S : Set V, simple_graph_external_boundary G S is defined to be the set of all vertices w : V such that w ∉ S and there exists a vertex u ∈ S that is adjacent to w in G (G.Adj u w).
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
/-- The external vertex boundary of a vertex set S in a simple graph G. -/ def simple_graph_external_boundary {V : Type*} (G : SimpleGraph V) (S : Set V) : Set V := {w | w ∉ S ∧ ∃ u ∈ S, G.Adj u w}