digraph_has_isolated_edge
def
A digraph G on vertex type V has an isolated edge if there exist vertices u and v such that G has a directed edge from u to v, and every vertex w having a directed edge to or from u or v is equal to u or equal to v.
Statement
def digraph_has_isolated_edge {V : Type*} (G : Digraph V) : Prop
- Defined in
- arXiv:2610.18600 Section 1.2
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 3
- digraph_has_isolated_edge_card_ge_twoIf a finite oriented digraph G : Digraph V satisfies digraph_has_isolated_edge G and digraph_is_oriented G, then Fintype.card V ≥ 2.
- digraph_semisaturation_isolated_edge_boundIf G : Digraph V is a finite oriented digraph with DecidableEq V and DecidableRel G.Adj satisfying digraph_is_oriented G and…
- digraph_semisaturation_bounded_of_isolated_edgeLet G : Digraph V be a finite oriented digraph on vertex type V with DecidableEq V and DecidableRel G.Adj such that digraph_is_oriented G…
Read back from the Lean
Given a type V and a directed graph G : Digraph V, there exist vertices u, v : V such that u is adjacent to v (G.Adj u v), and for every vertex w : V, if there is an edge between u and w in either direction (G.Adj u w or G.Adj w u) or between v and w in either direction (G.Adj v w or G.Adj w v), then w = u or w = v.
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 digraph contains an isolated edge if some directed edge has no other incident edges. -/ def digraph_has_isolated_edge {V : Type*} (G : Digraph V) : Prop := ∃ u v : V, G.Adj u v ∧ ∀ w : V, (G.Adj u w ∨ G.Adj w u ∨ G.Adj v w ∨ G.Adj w v) → (w = u ∨ w = v)