digraph_suppress_to
def
Suppress x into q, retaining all arcs between the remaining vertices and redirecting every arc into x to q, while omitting loops.
Statement
def digraph_suppress_to {α : Type} [DecidableEq α] (D : Digraph α) (x q : α) : Digraph {v : α // v ≠ x}
- Source
- Directed vertex suppression for the oriented twenty-cut profile.
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 1
- digraph_suppress_to_two_cycles_liftIf x has an arc to q, every pair of vertex-disjoint cycles after suppressing x into q lifts to a disjoint pair in the original digraph.
Lean source view module on GitHub
def digraph_suppress_to {α : Type} [DecidableEq α] (D : Digraph α) (x q : α) : Digraph {v : α // v ≠ x} := ⟨fun u v => u ≠ v ∧ (D.Adj u.val v.val ∨ (v.val = q ∧ D.Adj u.val x))⟩