cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A122027 #19 Sep 28 2020 21:46:16
%S A122027 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
%N A122027 Largest integer m such that every n-tournament contains a transitive (i.e., acyclic) sub-tournament with at least m vertices.
%D A122027 K. B. Reid, Tournaments, in Handbook of Graph Theory; see p. 167.
%D A122027 D. J. Wildstrom, Design and serial construction of digraph braids, Journal of Mathematics and the Arts, Volume 9, Issue 1-2, 2015.
%H A122027 W. D. Smith, <a href="http://rangevoting.org/PuzzDG.html">Partial Answer to Puzzle #21: Getting rid of cycles in directed graphs</a>
%H A122027 D. J. Wildstrom, <a href="http://bridgesmathart.org/2012/cdrom/proceedings/98/paper_98.pdf">Structural Qualities and Serial Construction of Tournament Braids</a>, in Bridges 2012: Mathematics, Music, Art, Architecture, Culture.
%H A122027 Yahoo Groups, <a href="http://groups.yahoo.com/group/RangeVoting/">Range Voting</a>
%H A122027 Range Voting Yahoo Group, <a href="/A003141/a003141.txt">Introduction</a>. [Cached copy]
%H A122027 RangeVoting.org, <a href="https://rangevoting.org/">Group Website</a>.
%Y A122027 Cf. A122026.
%K A122027 nonn,more
%O A122027 1,2
%A A122027 _Warren D. Smith_, Sep 11 2006