[1] F. G. ABRAMSON L. A. HARRINGTON: Models without indiscernibles. J. Symbolic Logic 43 (1978), 572-600. MR 0503795

[2] P. FRANKL R. L. GRAHAM V. RÖDL: Induced restricted Ramsey theorems for spaces. J. Comb. Th. A (1987), 120-128. MR 0871393

[3] R. GRAHAM K. LEEB B. ROTHSCHILD: Ramsey theorem for a class of categories. Advances in Math. 8, 3 (1972), 417-433. MR 0306010

[4] R. GRAHAM B. ROTHSCHILD: Ramsey's theorem for n-parameter sets. Trans. Amer. Math. Soc. 159 (1971), 257-292. MR 0284352

[5] R. GRAHAM B. ROTHSCHILD J. SPENCER: Ramsey Theory. Wiley, New York 1980. MR 0591457

[6] I. KŘÍŽ: A hypergraph-less construction of highly chromatic graphs without short cycles. (to appear).

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

[8] A. W. HALES R. I. JEWETT: Regularity and positional games. Trans. Amer. Math. Soc. 106 (1963), 222-229. MR 0143712

[9] J. NEŠETŘIL V. RÖDL: A structural generalization of the Ramsey theorem. Bull. Amer. Math. Soc. 83, 1 (1977), 127-128. MR 0422035

[10] J. NEŠETŘIL V. RÖDL: Partitions of relational and set systems. J. Comb. Th. B (1977), 289-312. MR 0437351

[11] J. NEŠETŘIL V. RÖDL: A short proof of the existence of highly chromatic graphs without short cycles. J. Comb. Th. B 27 (1979), 225-227. MR 0546865

[12] J. NEŠETŘIL V. RÖDL: Partition (Ramsey) theory - a survey. in: Coll. Math. Soc. János Bolyai, 18. Combinatorics, North Holland (1978), 759-792. MR 0519309

[13] J. NEŠETŘIL V. RÖDL: Partition theory and its applications. in: Surveys in Combinatorics, Cambridge Univ. Press, Cambridge (1979), 96-156. MR 0561308

[14] J. NEŠETŘIL V. RÖDL: Ramsey classes of set systems. J. Comb. Th. A 34, 2 (1983), 183-201. MR 0692827

[15] J. NEŠETŘIL V. RÖDL: Two proofs of the partition property of set systems. European J. of Comb. 3 (1982), 347-352. MR 0687733

[16] J. NEŠETŘIL V. RÖDL: A short proof of the existence of restricted Ramsey graphs by means of a partite construction. Combinatorica 1, 2 (1981), 199-202. MR 0625551

[17] J. NEŠETŘIL V. RÖDL: Sparse Ramsey graphs. Combinatorica 4, 1 (1984), 71-78. MR 0739415

[18] J. NEŠETŘIL V. RÖDL: Strong Ramsey theorems for Steiner systems. Trans. Amer. Math. Soc. 1987 - to appear. MR 0896015

[19] J. NEŠETŘIL V. RÖDL: Finite Union Theorem with restrictions. Graphs and Combinatorics 2 (1986), 357-361. MR 0951561

[20] J. NEŠETŘIL V. RÖDL: Partite construction and Ramsey set systems. (to appear). MR 1001405

[21] J. NEŠETŘIL V. RÖDL: Partite construction and Ramsey space systems. (to appear). MR 1083596

[22] j. NEŠETŘIL H. J. PRÖMMEL V. RÖDL B. VOIGT: Canonizing ordering Theorems for Hales-Jewett structures. J. Comb. Th. A 40 (1985), 394-408. MR 0814422

[23] H. J. PRÖMMEL: Induced partition properties of combinatorial cubes. J. Comb. Th. A 39 (1985), 177-208. MR 0793270

[24] F. P. RAMSEY: On a problem of formal logic. Proc. London Math. Soc. 30 (1930), 264-286.

[25] R. RADO: Studien zur Kombinatorik. Math. Z. 36 (1933), 424-480. MR 1545354 | Zbl 0006.14603

[26] R. GRAHAM J. NEŠETŘIL: Large sets without short arithmetic progression. J. Comb. Th. A 42 (1986), 270-276. MR 0847557

[27] V. RÖDL: Ramsey families of sets. (to appear). MR 1073689