[1] N. Alon, M. Krivelevich and B. Sudakov, Turán numbers of bipartite graphs
and related Ramsey-type questions, Combin. Probab. Comput. 12 (2003),
477-494.
[2] D. Conlon, A new upper bound for diagonal Ramsey numbers, Ann. of
Math. 170 (2009), 941-960.
[3] P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc.
53 (1947), 292-294.
[4] P. Erdős, On some problems in graph theory, combinatorial analysis and
combinatorial number theory, Graph Theory and Combinatorics, Cambridge,
(1983), Academic Press, London, (1984), 1-17.
[5] P. Erdős and R. Graham, On partition theorems for finite graphs, in: Infinite
and Finite Sets, vol. I, Colloq., Keszthely, (1973), in: Colloq. Math.
Soc. Janos Bolyai, vol. 10, North-Holland, Amsterdam, (1975), 515-527.
[6] P. Erdős and G. Szekeres, A Combinatorial problem in geometry, Compos.
Math. 2 (1935), 463-470.
[7] J. Fox and B. Sudakov, Dependent Random Choice, Random Struct. Algorithms
38 (2011), 68-99.
[8] S. P. Radziszowski, Small Ramsey numbers, Electron. J. Combin. 1 (1994),
Dynamic Surveys, DS1.12 (August 4, 2009).
[9] F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc.2 30
(1930), 264-286.
[10] V. Rosta, Ramsey Theory Applications, Electron. J. Combin. (2004), 1-43.
[11] B. Sudakov, A Conjecture of Erdős on graph Ramsey numbers, Advances
In Math. 227 (2011), 601-609.
Mathematical Research