Achlioptas, D. and Molloy, M. 1999. Almost all graphs with $2.522 n$ edges are not 3-colorable. The Electronic Journal of Combinatorics. 6, 1 (Jul. 1999), R29. DOI:https://doi.org/10.37236/1461.