@article{Ajtai1980ANO,
title={A Note on Ramsey Numbers},
author={Mikl{\'o}s Ajtai and John Komlos and Endre Szemer{\'e}di},
journal={J. Comb. Theory, Ser. A},
year={1980},
volume={29},
pages={354-360}
}

We prove that the number of integers in the interval [0,x] that are non-trivial Ramsey numbers r(k,n) (3 <= k <= n) has order of magnitude (x ln x)**(1/2).

In this paper we introduce Ramsey numbers and present some related results. In particular we compute the values for some easy cases and examine upper and lower bounds for the rest of the numbers.… Expand

This paper is a survey of the methods used for determining exact values and bounds for the classical Ramsey numbers in the case that the sets being colored are two-element sets. Results concerning… Expand

We outline background to a recent theorem [47] connecting optimal pseudorandom graphs to the classical off-diagonal Ramsey numbers r(s, t) and graph Ramsey numbers r(F, t). A selection of exercises… Expand

In this paper we prove several results on Ramsey numbers R(H,F ) for a fixed graph H and a large graph F , in particular for F = Kn. These results extend earlier work of Erdős, Faudree, Rousseau and… Expand

A recent breakthrough of Conlon and Ferber yielded an exponential improvement on the lower bounds for multicolor diagonal Ramsey numbers. In this note, we modify their construction and obtain… Expand

A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete… Expand