A122027 Largest integer m such that every n-tournament contains a transitive (i.e., acyclic) sub-tournament with at least m vertices.

1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6

Offset

1,2

References

K. B. Reid, Tournaments, in Handbook of Graph Theory; see p. 167.

D. J. Wildstrom, Design and serial construction of digraph braids, Journal of Mathematics and the Arts, Volume 9, Issue 1-2, 2015.

Links

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

W. D. Smith, Partial Answer to Puzzle #21: Getting rid of cycles in directed graphs

D. J. Wildstrom, Structural Qualities and Serial Construction of Tournament Braids, in Bridges 2012: Mathematics, Music, Art, Architecture, Culture.

Yahoo Groups, Range Voting

Range Voting Yahoo Group, Introduction. [Cached copy]

RangeVoting.org, Group Website.

Crossrefs

Cf. A122026.

Sequence in context: A238407 A196050 A334097 * A359121 A112751 A316843

Adjacent sequences: A122024 A122025 A122026 * A122028 A122029 A122030

Keyword

nonn,more

Author

Warren D. Smith, Sep 11 2006

Status

approved