Coloring n-Sets Red and Blue

Abstract A short proof is given of the following result of J. Beck. Given any m = 2 n n 1 3 +o(1) sets of cardinality n, there exists a 2-coloring of the underlying points so that no set is monochromatic.