A universal tournament of order 
, or 
-universal tournament, is a tournament
containing every tournament on 
vertices as an induced
subgraph. Write 
for the smallest number of vertices
in such a tournament.
Verma (2026) gave an explicit tournament on 14 vertices and checked by exhaustive computation that
it is 7-universal. Together with the known lower bound
this gives 
,
improving the previous upper bound of 15 but not determining
exactly.
