%0 Journal Article
%A Dimitris Achlioptas
%A Michael Molloy
%T Almost all graphs with 2. 522\(n\) edges are not 3-colorable
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1461/
%R 10.37236/1461
%F 10_37236_1461