Why almost all k-colorable graphs are easy to color

Theory of Computing Systems

Volumn 46, Issue 3, 2010, Pages 523-565

  Coja Oghlan, Amin ^a   Krivelevich, Michael ^b   Vilenchik, Dan ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b TEL AVIV UNIVERSITY   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Average case analysis; k colorability; Random graphs; Spectral analysis

Indexed keywords

AVERAGE-CASE ANALYSIS; EDGE DENSITIES; HARD PROBLEMS; K-COLORABILITY; K-COLORABLE GRAPHS; POLYNOMIAL-TIME ALGORITHMS; RANDOM GRAPHS; UNIFORM DISTRIBUTION;

COLOR; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SPECTRUM ANALYSIS;

GRAPH THEORY;

EID: 77951258141     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-009-9231-5     Document Type: Article

References (26)

1. Achlioptas, D., Friedgut, E.: A sharp threshold for k-colorability. Random Struct. Algorithms 14(1), 63-70 (1999).
2. Achlioptas, D., Moore, C.: Random k-sat: Two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740-762 (2006).
3. Achlioptas, D., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. In: Proc. 38th ACM Symp. on Theory of Computing.
4. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26(6), 1733-1748 (1997).
5. Ben-Shimon, S., Krivelevich, M.: Random regular graphs of non-constant degree: edge distribution and applications. Manuscript (2006).
6. Blum, A., Spencer, J.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19(2), 204-234 (1995).
7. Bollobás, B.: The chromatic number of random graphs. Combinatorica 8(1), 49-55 (1988).
8. Böttcher, J.: Coloring sparse random k-colorable graphs in polynomial expected time. In: Proc. 30th International Symp. on Mathematical Foundations of Computer Science, pp. 156-167 (2005).
9. Braunstein, A., Mézard, M., Weigt, M., Zecchina, R.: Constraint satisfaction by survey propagation. Comput. Complex. Stat. Phys. (2005).
10. Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27, 201-226 (2005).
11. Coja-Oghlan, A.: Coloring semirandom graphs optimally. In: Proc. 31st International Colloquium on Automata, Languages, and Programming, pp. 383-395 (2004).
12. Coja-Oghlan, A., Krivelevich, M., Vilenchik, D.: Why almost all satisfiable k-cnf formulas are easy. In: 13th Conference on Analysis of Algorithms, DMTCS Proceedings, pp. 89-102 (2007).
13. Daudé, H., Mézard, M., Mora, T., Zecchina, R.: Pairs of sat-assignments in random boolean formulæ. Theoret. Comput. Sci. 393(1-3), 260-279 (2008).
14. Dyer, M. E., Frieze, A. M.: The solution of some random np-hard problems in polynomial expected time. J. Algorithms 10(4), 451-489 (1989).
15. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187-199 (1998).
16. Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. Syst. Sci. 63(4), 639-671 (2001).
17. Feige, U., Mossel, E., Vilenchik, D.: Complete convergence of message passing algorithms for some satisfiability problems. In: Random, pp. 339-350 (2006).
18. Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2), 251-275 (2005).
19. Friedman, J., Kahn, J., Szemerédi, E.: On the second eigenvalue in random regular graphs. In: Proc. 21st ACM Symp. on Theory of Computing, pp. 587-598 (1989).
20. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13-30 (1963).
21. Krivelevich, M., Vilenchik, D.: Semirandom models as benchmarks for coloring algorithms. In: 3rd Workshop on Analytic Algorithmics and Combinatorics, pp. 211-221 (2006).
22. Kučera, L.: Expected behavior of graph coloring algorithms. In: Proc. Fundamentals of Computation Theory. Lecture Notes in Comput. Sci., vol. 56, pp. 447-451. Springer, Berlin (1977).
23. Łuczak, T.: The chromatic number of random graphs. Combinatorica 11(1), 45-54 (1991).
24. Mulet, R., Pagnani, A., Weigt, M., Zecchina, R.: Coloring random graphs. Phys. Rev. Lett. 89(26), 268701 (2002).
25. Prömel, H., Steger, A.: Random l-colorable graphs. Random Struct. Algorithms 6, 21-37 (1995).
26. Turner, J. S.: Almost all k-colorable graphs are easy to color. J. Algorithms 9(1), 63-82 (1988).