D. Achlioptas and E. Friedgut, A Sharp Threshold fork-Colorability, Random Structures and Algorithms, vol.7, issue.1, pp.63-70, 1999.
DOI : 10.1002/(SICI)1098-2418(1999010)14:1<63::AID-RSA3>3.0.CO;2-7

D. Achlioptas and M. Molloy, Almost all graphs with 2.522n edges are not 3-colorable, Electronic Journal of Combinatorics, vol.6, issue.1, 1999.

N. Alon, J. H. Spencer, and P. Erdös, The Probabilistic Method, 1992.

B. Bollobás, Random Graphs, 1985.

M. J. Box, A new method of constrained optimisation and a comparison with other methods. The Comp, Journal, vol.8, pp.42-52, 1965.

B. D. Bunday, Basic Optimisation Methods, 1984.

O. Dubois and Y. Boufkhad, A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae, Journal of Algorithms, vol.24, issue.2, pp.395-420, 1997.
DOI : 10.1006/jagm.1997.0867

P. E. Dunne and M. Zito, An improved upper bound on the non-3-colourability threshold, Information Processing Letters, vol.65, issue.1, pp.17-23, 1998.
DOI : 10.1016/S0020-0190(97)00193-2

P. Erdös and A. Rényi, On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp.17-61, 1960.

N. Fountoulakis, On the upper bound of the non-3-colourability threshold of random graphs. MSc Dissertation, 2000.

I. Giotis, A. C. Kaporis, and L. M. Kirousis, Corrigendum to " A note on the non-colourability threshold of a random graph, Electronic Journal of Combinatorics, vol.7, issue.1, p.29, 2000.

T. Hogg and C. P. Williams, The hardest constraint problems: A double phase transition, Artificial Intelligence, vol.69, issue.1-2, pp.359-377, 1994.
DOI : 10.1016/0004-3702(94)90088-4

A. C. Kaporis, L. M. Kirousis, and Y. C. Stamatiou, A note on the non-colourability threshold of a random graph, Electronic Journal of Combinatorics, vol.7, issue.1, p.29, 2000.

L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. C. Stamatiou, Approximating the unsatisfiability threshold of random formulas, Random Structures and Algorithms, vol.12, issue.3, pp.253-269, 1998.
DOI : 10.1002/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U

C. J. Mcdiarmid, On the method of bounded differences, Surveys in Combinatorics, pp.148-188, 1989.
DOI : 10.1017/CBO9781107359949.008

M. Molloy, The chromatic number of sparse random graphs, 1992.

M. Molloy, Thresholds for colourability and satisfiability in random graphs and boolean formulae, Surveys in Combinatorics, pp.166-200, 2001.
DOI : 10.1017/CBO9780511721328.009

G. Strang, Linear Algebra and its Applications, 1988.

N. M. Temme, Asymptotic Estimates of Stirling Numbers, Studies in Applied Mathematics, vol.XLIII:, issue.3, pp.223-243, 1993.
DOI : 10.1002/sapm1993893233