1. D. Achlioptas and M. Molloy, “Almost all graphs with 2.522 n edges are not 3-colorable,” Manuscript, University of Toronto.
2. N. Alon, J.H. Spencer, and P. Erdös, The Probabilistic Method, J. Wiley, New York (1992).
3. D.G. Bobrow and M. Brady, eds., Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity, Guest editors: T. Hogg, B.A. Hubermann, and C.P. Williams, Artificial Intelligence, Vol. 81, Numbers 1–2 (1996).
4. B. Bollobás, Random Graphs, Academic Press, London (1985).
5. A.Z. Broder, A.M. Frieze, and E. Upfal, “On the satisfiability and maximum satisfiability of random 3-CNF formulas,” Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993) 322‐330.