AFTD Auto-Formalizing Theoretical Domains

tournament_is_near_regular

def

A tournament on 2m vertices is near-regular if every vertex has out-degree m - 1 or m.

Statement

def tournament_is_near_regular (m : ℕ) (D : Digraph (Fin (2 * m))) [DecidableRel D.Adj] : Prop
Defined in
J.W. Moon, Topics on Tournaments (1968), Section 3
Verified
27 Oct 2026
Axioms
none listed
Built on 1
Used by 8

Read back from the Lean

A definition stating that for a natural number m, a directed graph D on vertex set Fin (2 * m), and decidable adjacency on D: for every vertex v : Fin (2 * m), the out-degree of v in D is equal to m - 1 or equal to m.

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 tournament on 2m vertices is near-regular if every vertex has out-degree m - 1 or m. -/
def tournament_is_near_regular (m : ℕ) (D : Digraph (Fin (2 * m))) [DecidableRel D.Adj] : Prop := ∀ v : Fin (2 * m), digraph_out_count D v = m - 1 ∨ digraph_out_count D v = m
See it in the graphDiscuss this resultChallenge it