A120414 Conjectured Ramsey number R(n,n).

0, 1, 2, 6, 18, 45, 102, 213, 426, 821, 1538, 2820, 5075, 8996, 15743, 27247, 46709, 79405, 133996, 224640, 374400

Offset

0,3

Comments

R(m,n) = minimal number of nodes R such that in any graph with R nodes there is either an m-clique or an independent set of size n. This sequence gives the diagonal entries R(n,n).

Only these values have been proved: 0,1,2,6,18. a(5) is known to be in the range 43-49. - N. J. A. Sloane, Sep 16 2006

a(5) is at most 48, see the Angeltveit/McKay reference. - Jurjen N.E. Bos, Apr 11 2017

Ramsey numbers for simple binary partition.

Campos, Griffiths, Morris, & Sahasrabudhe prove that R(n,n) < 3.993^n for large enough n; they say the constant "could be improved further with some additional (straightforward, but somewhat technical) optimisation". This sequence posits a constant of 1.5. - Charles R Greathouse IV, Mar 18 2023

References

G. Berman and K. D. Fryer, Introduction to Combinatorics. Academic Press, NY, 1972, p. 175.

Links

Table of n, a(n) for n=0..20.

Vigleik Angeltveit, Brendan D. McKay, R(5,5) <= 48, arXiv:1703.08768 [math.CO], (Apr 10 2017).

Marcelo Campos, Simon Griffiths, Robert Morris, and Julian Sahasrabudhe, An exponential improvement for diagonal Ramsey, arXiv preprint (2023). arXiv:2303.09521 [math.CO]

R. E. Greenwood and A. M. Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math., 7 (1955), 1-7.

Eric Weisstein's World of Mathematics, Ramsey Number

Wikipedia, Ramsey's theorem.

Formula

a(n) = ceiling((3/2)^(n-3)*n*(n-1)), for n > 1.

Crossrefs

Cf. A000791 (which has many more references).

Sequence in context: A320303 A319415 A230137 * A251685 A341490 A308305

Adjacent sequences: A120411 A120412 A120413 * A120415 A120416 A120417

Keyword

easy,nonn

Author

Jeff Boscole (jazzerciser(AT)hotmail.com), Jul 06 2006

Extensions

Edited by N. J. A. Sloane, Sep 16 2006

Status

approved