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

: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model for graphs has been started by Bohman et al. (Random Struct Algorithms 22 (2003) 33

• Type: Journal
• Year: 2008
• Where: RSA
• Authors: Benny Sudakov, Jan Vondrák
• Keywords: Random, Random Edges, Random Struct Algorithms, RSA 2008