login
A122027
Largest integer m such that every n-tournament contains a transitive (i.e., acyclic) sub-tournament with at least m vertices.
2
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
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
KEYWORD
nonn,more
AUTHOR
Warren D. Smith, Sep 11 2006
STATUS
approved