[1] ERICKSON M.: An upper bound for the Folkman number F(3,3;5). J. Graph Theory 17 (1993), 679-681. MR 1244683 | Zbl 0791.05039

[2] FOLKMAN J.: Graphs with monochromatic complete subgraphs in every edge-coloring. SIAM J. Appl. Math. 18 (1970), 19-24. MR 0268080 | Zbl 0193.53103

[3] GRAHAM R. L.: On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon. J. Combin. Theory 4 (1968), 300. MR 0219443

[4] GRAHAM R. L., SPENCER J. H.: On small graphs with forced monochromatic triangles. In: Recent Trends in Graph Theory. Lecture Notes in Math. 186. Springer. New York-Berlin, 1971, pp. 137-141. MR 0291018 | Zbl 0214.23201

[5] IRVING R. W.: On a Bound of Graham and Spencer for graph-coloring constant. J. Combin. Theory Ser. B 15 (1973), 200-203. MR 0321778

[6] LIN S.: On Ramsey numbers and $K_r$-coloring of graphs. J. Combin. Theory Ser. B 12 (1972), 89-72. MR 0289357