[1] J. E. BAUMGARTNER A. D. TAYLOR:
Partition theorems and ultrafilters. (to appear).
MR 0491193
[2] N. G. de BHUIJN P. ERDÖS:
A colour problem for infinite graphs and a problem in the theory of relations. Indag. Math. 13 (1951), 369-373.
MR 0046630
[3] P. ERDÖS:
Graph theory and probability. Canad. J. Math. 11 (1959), 34-38.
MR 0102081
[5] L. LOVÁSZ:
On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hung. 19 (1968), 59-67.
MR 0220621
[6] J. NEŠETŘIL V. RÖDL: A short proof of the existence of highly chromatic graphs without short cycles. (to appear in J. Comb. Th.).
[7] J. NEŠETŘIL V. RÖDL:
Partitions of finite relational and set systems. J. Comb. Th. A, 22 (1977), 289-312.
MR 0437351
[8] J. PELANT J. REITERMAN V. RÖDL P. SIMON: Fine classification of ultrafilters. (in preparation).
[9] P. SIMON:
Uniform atoms on $\omega $. Seminar uniform spaces 1975/76 (Z. Frolík ed.), Math. Institute Czech. Acad. Sci., Prague, 7-35.
MR 0383356