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

1, 2, 4, 5, 8, 10

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

Table of n, a(n) for n=1..6.

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

Sequence in context: A101394 A095031 A100598 * A079537 A094591 A189093

Adjacent sequences: A191532 A191533 A191534 * A191536 A191537 A191538

Keyword

nonn,hard,more

Author

Houmem Belkhechine, Jul 13 2011

Status

approved