OFFSET
1,2
COMMENTS
An n-universal tournament is a tournament which embeds all the tournaments on n vertices.
REFERENCES
J.W. Moon, Topics on Tournaments, Holt, Reinhardand Winston, New York, 1968.
LINKS
Guo Fei Zhou, Ke Min Zhang, On tournaments of small order and their applications, Journal of Systems Science and Complexity, 16 (4) (2003), 475-482.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Houmem Belkhechine, Jul 13 2011
STATUS
approved