AFTD Auto-Formalizing Theoretical Domains

digraph_is_tournament

def

A digraph is a tournament when it has no loops and between any two distinct vertices there is exactly one arc.

Statement

def digraph_is_tournament {V : Type*} (D : Digraph V) : Prop
Defined in
arXiv:2610.13798 (On the failure of additivity of inversion numbers for dijoins), Sec. 2.1 (tournaments).
Verified
13 Oct 2026
Axioms
none listed
Used by 51

Lean source view module on GitHub

/-- A tournament: no loops, and between two distinct vertices exactly one arc. -/
def digraph_is_tournament {V : Type*} (D : Digraph V) : Prop :=
  (∀ x, ¬ D.Adj x x) ∧ ∀ x y, x ≠ y → (D.Adj x y ↔ ¬ D.Adj y x)
See it in the graphDiscuss this resultChallenge it