|
|
A000791
|
|
Ramsey numbers R(3,n).
(Formerly M2530 N0998)
|
|
8
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(10) is either 40, 41, or 42 (Goedgebeur, Radziszowski). - Ray G. Opao, Oct 07 2015
Kim proves that a(n) ≍ n/log n; the lower and upper constants, respectively, can be chosen arbitrarily close to 1/162 and 1. (Kim notes that he made no attempt to make 1/162 tight.) - Charles R Greathouse IV, Jun 23 2023
|
|
REFERENCES
|
G. Berman and K. D. Fryer, Introduction to Combinatorics. Academic Press, NY, 1972, p. 175.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 288.
J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 840.
Brendan McKay, personal communication.
H. J. Ryser, Combinatorial Mathematics. Mathematical Association of America, Carus Mathematical Monograph 14, 1963, p. 42.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Vigleik Angeltveit, R(3,10) <= 41, arXiv:2401.00392 [math.CO], 2023.
I. Peterson, Math Trek, Party Games, Science News Online, Vol. 156, No. 23, Dec 04 1999.
Stanislaw Radziszowski, Small Ramsey Numbers, The Electronic Journal of Combinatorics, Dynamic Surveys, #DS1: Jan 12, 2014.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|