[0] J. Folkman: Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Applied Math. 18 (1970), 19-29. DOI 10.1137/0118004 | MR 0268080 | Zbl 0193.53103

[1] R. L. Graham B. L. Rotschild: Some recent development in Ramsey theory. Mathematical Centre Tracts 56 (1974), 61-76. MR 0373948

[2] J. Nešetřil V. Rödl: Type theory of partition properties of graphs. Recent Advances in Graph Theory, Academia, Praha (1975), 405-412. MR 0409259

[3] J. Nešetřil V. Rödl: A Ramsey graph without triangles exists for every graph without triangles. Coll. Math. Soc. Janos Bolyai 10, North Holland Publ. Co. (1975), Amsterdam, 1127-1132. MR 0392695

[4] J. Nešetřil V. Rödl: Ramsey property of graphs with forbidden complete subgraphs. J. Comb. Th. В 20 (1976), 243-249. DOI 10.1016/0095-8956(76)90015-0 | MR 0412004

[5] J. Nešetřil, V, Rödl: Partitions of vertices. Comment. Math. Univ. Carol., 17,1 (1976), 85 - 95. MR 0412044

[6] J. Nešetřil V. Rödl: Partitions of finite relational and set systems. J. Comb. Th. A. 22 (1977), 289-312. DOI 10.1016/0097-3165(77)90004-8 | MR 0437351

[7] F. P. Ramsey: On a problem of formal logic. Proc. London. Math. Soc. 30 (1930), 264-286. DOI 10.1112/plms/s2-30.1.264