[0] P. ERDÖS: Problems and results on finite and infinite graphs. in: Recent advances in graph theory, Academia, Prague (1975), pp. 183-192. MR 0389669

[1] ERDÖS P., HAJNAL A.: On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hungar, 17 (1966), 61-99. MR 0193025

[2] ERDÖS P., HAJNAL A.: Problems and results in finite and infinite combinatorial analysis. Ann. of N.Y. Acad. Sci., 175 (1970), 115-124. MR 0263675

[3] FOLKMAN J.: Graphs with monochromatic complete subgraphs in every edge colouring. SIAM J. Appl. Math. 18 (1970), 19-29. MR 0268080

[4] R. L. GRAHAM B. L. ROTHSCHILD: Some recent developments in Ramsey theory. in: Mathematical centre tracts, Amsterdam, 57 (1974), pp. 61-67. MR 0373948

[5] HARARY F.: Graph theory. Addison-Wealey, Reading (1969). MR 0256911 | Zbl 0196.27202

[6] LOVÁSZ L.: On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67. MR 0220621

[7] NEŠETŘIL J., RÖDL V.: The Ramsey property for graphs with forbidden complete subgraphs. to appear in Journal of Comb. Theory. MR 0412004

[8] J. NEŠETŘIL V. RÖDL: Type theory of partition problems of graphs. in: Recent advances in graph theory, Academia, Prague (1975), 405-412. MR 0409259

[9] PROCEEDINGS of Set theory conference. Készthély (1973).

[10] RÖDL V.: The dimension of a graph and a generalized Ramsey theorem. Thesis Charles University Praha (1973).