Beck, J. (1978) On 3-chromatic hypergraphs. Discrete Math. 24 127–137.
 Cherkashin, D. D. and Kozik, J. (2015) A note on random greedy coloring of uniform hypergraphs. Random Struct. Alg. 47 407–413.
 Kronenberg, G., Kusch, C., Micek, P. and Tran, T. A note on the minimum number of edges in hypergraphs with Property O. arXiv:1703.09767v1
 Nešetřil, J. and Rödl, V. (1975) Partitions of subgraphs. In Recent Advances in Graph Theory, Academia, pp. 413–423.
 Nešetřil, J. and Rödl, V. (1978) On a probabilistic graph-theoretical method. Proc. Amer. Math. Soc. 72 417–421.
 Radhakrishnan, J. and Srinivasan, A. (2000) Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Alg. 16 4–32.
 Spencer, J. H. (1981) Coloring n-sets red and blue. J. Combin. Theory Ser. A 30 112–113.