Almost all graphs with 2. 522 n edges are not 3-colorable. Achlioptas, Dimitris; Molloy, Michael — 1999 The Electronic Journal of Combinatorics [electronic only]
Critical subgraphs of a random graph. Molloy, Michael; Reed, Bruce — 1999 The Electronic Journal of Combinatorics [electronic only]