Paperlane

no. 7 · Tuesday 3 November 2026

A New Upper Bound for 7-Universal Tournaments

Harshit Verma

math.CO · v2

Abstract

A tournament is $k$-universal if it contains every tournament on $k$ vertices as a subtournament. We give a 7-universal tournament on 14 vertices, improving the upper bound of 15 due to Zhang and Szeider. Together with their lower bound, it follows that the smallest 7-universal tournament has 13 or 14 vertices.

fields
Combinatorics
pdf ↗ page arXiv:2610.06891 ↗