How many random edges make a dense hypergraph non-2-colorable?

Benny Sudakov, Jan Vondrák. How many random edges make a dense hypergraph non-2-colorable?. Random Struct. Algorithms, 32(3):290-306, 2008. [doi]

Abstract

Abstract is missing.