1. A sharp threshold for k-colorability;Achlioptas;Random Structures Algorithms,1999
2. D. Achlioptas M. Molloy 1997 38th Annual Symposium on Foundations of Computer Science (FOCS ′97) 204 212 107, 196
3. Almost all graphs with 2.522n edges are not 3-colorable;Achlioptas;Electronic J. Comb,1999
4. An inequality for the weights of two families of sets, their unions and intersections;Ahlswede;Z. Wahrscheinl. Geb,1978