tournament_covers
def
A vertex w covers a vertex v in a tournament T if w -> v and w -> x for every out-neighbor x of v.
Statement
def tournament_covers {V : Type*} (T : Digraph V) (w v : V) : Prop
- Defined in
- arXiv:2610.40521 Definition 3
- Verified
- 30 Oct 2026
- Axioms
- none listed
- Used by 1
- tournament_exists_covering_realization_of_realizesLet d be a degree vector on Fin n realized by a tournament T, and let v, w be vertices in Fin n satisfying d v < d w. Then there exists a…
Read back from the Lean
For a type V, a directed graph T with vertex type V, and vertices w, v : V, tournament_covers T w v holds if and only if:
1. w is adjacent to v in T (T.Adj w v), and
2. for every vertex x : V, if v is adjacent to x in T (T.Adj v x), then w is adjacent to x in T (T.Adj w x) (that is, every out-neighbor of v is also an out-neighbor of w).
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 vertex w covers v in a tournament T if w points to v and to every out-neighbor of v. -/ def tournament_covers {V : Type*} (T : Digraph V) (w v : V) : Prop := T.Adj w v ∧ ∀ x, T.Adj v x → T.Adj w x