M. Ajtai, J. Komlós, and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A, vol.29, issue.3, pp.354-360, 1980.

M. Ajtai, J. Komlós, and E. Szemerédi, A dense infinite Sidon sequence, European J. Combin, vol.2, issue.1, pp.1-11, 1981.

M. Cropper, A. Gyárfás, and J. Lehel, Hall ratio of the Mycielski graphs, Discrete Math, vol.306, issue.16, 1988.

P. Erd?s and A. Hajnal, Problem 3. Theory of Graphs, Proc. Colloq, p.362, 1966.

J. H. Folkman, An upper bound on the chromatic number of a graph, Combinatorial theory and its application, II, (Proc. Colloq, pp.437-457, 1969.

J. R. Griggs, An upper bound on the Ramsey numbers R(3, k), J. Combin. Theory Ser. A, vol.35, issue.2, pp.145-153, 1983.

, András Gyárfás. Fruit salad. Electron. J. Combin, vol.4, issue.1, 1997.

A. Hajnal, A theorem on k-saturated graphs, Canad. J. Math, vol.17, pp.720-724, 1965.

K. Jeong-han, The Ramsey number R(3, t) has order of magnitude t 2 / log t, Random Structures Algorithms, vol.7, issue.3, pp.173-207, 1995.

M. Larsen, J. Propp, and D. Ullman, The fractional chromatic number of Mycielski's graphs, J. Graph Theory, vol.19, issue.3, pp.411-416, 1995.

B. Reed, Mangoes and blueberries, Combinatorica, vol.19, issue.2, pp.267-296, 1999.

, Research Experiences for Graduate Students (REGS), 2008.

J. B. Shearer, A note on the independence number of triangle-free graphs, II. J. Combin. Theory Ser. B, vol.53, issue.2, pp.300-307, 1991.