Almost all graphs with 2. 522n edges are not 3-colorable.
Achlioptas, Dimitris ; Molloy, Michael
The Electronic Journal of Combinatorics [electronic only], Tome 6 (1999), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1999-01-01
EUDML-ID : urn:eudml:doc:119877 
@article{01326125,
     title = {Almost all graphs with 2. 522},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {6},
     year = {1999},
     zbl = {0919.05056},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01326125}
}

Achlioptas, Dimitris; Molloy, Michael. Almost all graphs with 2. 522. The Electronic Journal of Combinatorics [electronic only], Tome 6 (1999) . http://gdmltest.u-ga.fr/item/01326125/