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]
@article{SudakovV08:0,
title = {How many random edges make a dense hypergraph non-2-colorable?},
author = {Benny Sudakov and Jan Vondrák},
year = {2008},
doi = {10.1002/rsa.25155},
url = {http://dx.doi.org/10.1002/rsa.25155},
researchr = {https://researchr.org/publication/SudakovV08%3A0},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {290-306},
}