A note on the non-colorability threshold of a random graph

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-12

  Kaporis, Alexis C ^a   Kirousis, Lefteris M ^a   Stamatiou, Yannis C ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043059173     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1507     Document Type: Article

References (17)

1. D. Achlioptas and M. Molloy, "The analysis of a list-coloring algorithms on a random graph," in Proc. 38th Annual Symposium on Foundations of Computer Science, pp 204-212, 1997.
2. D. Achlioptas and M. Molloy, "Almost all graphs with 2.522n edges are not 3-colorable," Electronic Journal of Combinatorics, 6 (1), 1999.
3. R.M. Corless, G.H. Gonnet, D.E.G. Hare, D.J. Jeffrey, and D.E. Knuth, "On the Lambert W function," manuscript, Computer Science Department, University of Waterloo.
4. O. Dubois and Y. Boufkhad, "A general upper bound for the satisfiability threshold of random r-SAT," J. of Algorithms 24, pp 395-420, 1997.
5. P.E. Dunne and M. Zito, "An improved upper bound on the non 3-colourability threshold," Information Processing Letters, 65, pp 17-23, 1998.
6. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Edition, 1968.
7. N. Fountoulakis and C. McDiarmid, personal communication.
8. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, "Tail bounds for the occupancy and the satisfiability threshold conjecture," Random Structures and Algorithms 7, pp 59-80, 1995. Also in: Proc. 35th FOCS, IEEE, pp 592-603, 1994.
9. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, "Tail bounds for the occupancy and the satisfiability threshold conjecture," Random Structures and Algorithms 7, pp 59-80, 1995. Also in: Proc. 35th FOCS, IEEE, pp 592-603, 1994.
10. A.C. Kaporis, L.M. Kirousis, Y.C. Stamatiou, M. Vamvakari, and M. Zito "The unsatisfiability threshold revisited," submitted.
11. L.M. Kirousis, E. Kranakis, D. Krizanc, and Y.C. Stamatiou, "Approximating the unsatisfiability threshold of random formulas," Random Structures and Algorithms 12, pp 253-269, 1998.
12. V.F. Kolchin, Random Mappings, Translation series in Mathematics and Engineering, Optimization Software Inc., New York, 1986.
13. M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, and S.M. Vorkoetter, Programming Guide, Maple V Release 5, Springer-Verlag, 1998.
14. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, 2nd edition, Cambridge University Press, 1993.
15. A.E. Taylor, W.R Mann, Advanced Calculus, 3rd edition, John Wiley & Sons, 1983.
16. F.J. Wright: http://centaur.maths.qmw.ac.uk/Computer_Algebra/. A Maple (version V release 5) implementation of Downhill Simplex based on code given in [13].
17. M. Zito, Randomised Techniques in Combinatorial Algorithmics, PhD Thesis, Department of Computer Science, University of Warwick, November 1999.