|
%I M1000 #11 Mar 30 2012 16:44:49
%S 1,2,4,6,9,12,20,24,30,35,44,50
%N a(n) = largest integer such that every tournament on n nodes contains a consistent set of n arcs.
%D J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 167.
%D K. B. Reid and L. W. Beineke "Tournaments", pp. 169-204 in L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, Academic Press, NY, 1978.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>
%K nonn
%O 2,2
%A _N. J. A. Sloane_.
|
