Achlioptas, Dimitris, and Michael Molloy. “Almost All Graphs With $2.522 N$ Edges Are Not 3-Colorable”. The Electronic Journal of Combinatorics 6, no. 1 (July 1, 1999): R29. Accessed March 28, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v6i1r29.