login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005779 a(n) = largest integer such that every tournament on n nodes contains a consistent set of n arcs.
(Formerly M1000)
0
1, 2, 4, 6, 9, 12, 20, 24, 30, 35, 44, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

REFERENCES

J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 167.

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=2..13.

Index entries for sequences related to tournaments

CROSSREFS

Sequence in context: A173784 A094660 A005690 * A261417 A098387 A283525

Adjacent sequences:  A005776 A005777 A005778 * A005780 A005781 A005782

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 19:19 EST 2018. Contains 317116 sequences. (Running on oeis4.)