A191535 The least integer N for which there exists an n-universal tournament on N vertices.

1, 2, 4, 5, 8, 10

Offset: 1

Author

Houmem Belkhechine, Jul 13 2011

Keywords

• nonn
• hard
• more

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.