digraph_is_vertex_transitive
def
A directed graph G is vertex-transitive if for any two vertices u and v of G, there exists a graph automorphism of G mapping u to v.
Statement
def digraph_is_vertex_transitive {V : Type*} (G : Digraph V) : Prop
- Defined in
- arXiv:2610.18600 Section 3
- Verified
- 25 Oct 2026
- Axioms
- none listed
Read back from the Lean
Given a type V and a directed graph G : Digraph V with adjacency relation G.Adj, digraph_is_vertex_transitive G is the proposition that for all vertices u : V and v : V, there exists an automorphism of G (a relation isomorphism e : G.Adj ≃r G.Adj) such that e u = 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 directed graph is vertex-transitive if its automorphism group acts transitively on its vertices. -/ def digraph_is_vertex_transitive {V : Type*} (G : Digraph V) : Prop := ∀ u v : V, ∃ e : G.Adj ≃r G.Adj, e u = v