  We show how to construct a non-2-colorable k-uniform hypergraph with (2^(1 +
o(1)))^k edges. By the duality of hypergraphs and monotone k-CNF-formulas this
gives an unsatisfiable monotone k-CNF with (2^(1 + o(1)))^k clauses
