AFTD Auto-Formalizing Theoretical Domains

digraph_reverse_arc

abbrev

The digraph obtained from D by reversing the arc between u and v: the two vertices exchange which of them points to the other, and every other adjacency is untouched.

Statement

abbrev digraph_reverse_arc {n : ℕ} (D : Digraph (Fin n)) (u v : Fin n) : Digraph (Fin n)
Source
step towards tournament_not_near_regular_exists_improving_tournament
Verified
27 Oct 2026
Axioms
none listed
Used by 8

Lean source view module on GitHub

/-- Reverse the single arc between u and v of a digraph. -/
abbrev digraph_reverse_arc {n : ℕ} (D : Digraph (Fin n)) (u v : Fin n) : Digraph (Fin n) := ⟨fun x y => if (x = u ∧ y = v) ∨ (x = v ∧ y = u) then D.Adj y x else D.Adj x y⟩
See it in the graphDiscuss this resultChallenge it