AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_hop

def

A hop (graph derangement) of a graph G is a permutation h of the vertices that sends every vertex v to a neighbour h(v) of v.

Statement

def simple_graph_is_hop {V : Type*} (G : SimpleGraph V) (h : Equiv.Perm V) : Prop
Defined in
arXiv:2610.18463 (The group generated by a graph's derangements), Sec. 1 (definition of a hop; called a graph derangement in earlier work).
Verified
15 Oct 2026
Axioms
none listed
Used by 39

Lean source view module on GitHub

/-- A hop of `G`: a permutation sending every vertex to one of its neighbours. -/
def simple_graph_is_hop {V : Type*} (G : SimpleGraph V) (h : Equiv.Perm V) : Prop :=
  ∀ v, G.Adj v (h v)
See it in the graphDiscuss this resultChallenge it