The Lovász number of random graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 228-239

  Coja Oghlan, Amin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION;

CHROMATIC NUMBER; COLORABILITY; EXPECTED TIME; INDEPENDENCE NUMBER; RANDOM GRAPHS; SDP RELAXATION;

APPROXIMATION ALGORITHMS;

EID: 35248882498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_20     Document Type: Article

References (28)

1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 (1997) 1733-1748
2. Alon, N., Krivelevich, M.: The concentration of the chromatic number of random graphs. Combinatorica 17 303-313
3. Charikar, M.: On semidefinite programming relaxations for graph coloring and vertex cover. Proc. 13th SODA (2002) 616-620
4. Coja-Oghlan, A., Taraz, A.: Exact and approximative algorithms for colouring G(n,p). preprint (available from http://www.informatik.hu-berlin.de/~coja/).
5. A preliminary version has appeard in Proc. 20th STACS (2003) 487-498
6. Coja-Oghlan, A.: Finding large independent sets in polynomial expected time. Proc. 20th STACS (2003) 511-522
7. Coja-Oghlan, A., Moore, C., Sanwalani, V.: MAX k-CUT and approximating the chromatic number of random graphs. available from http://www.informatik.hu-berlin.de/~coja/. An extended abstract version has appeared in Proc. ICALP 2003.
8. Feige, U.: Randomized graph products, chromatic numbers, and the Lovász theta function. Combinatorica 17(1) 79-90
9. Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. and System Sci. 63 (2001) 639-671
10. Feige, U. and Kilian, J.: Zero knowledge and the chromatic number. Proc. 11th IEEE Conf. Comput. Complexity (1996) 278-287.
11. Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs, report MCS03-01, Weizmann Institute (2003) (available from http://www.wisdom.weizmann.ac.il/math/research.shtml)
12. Friedman, J., Kahn, J., Szemeredi, E.: On the second eigenvalue in random regular graphs. Proc. 21st STOC (1989) 587-598.
13. Frieze, A., McDiarmid, C.: Algorithmic theory of random graphs. Random Structures & Algorithms 10 (1997) 5-42
14. Füredi, Z., Komloś, J.: The eigenvalues of random symmetric matrices, Combinatorica 1 (1981) 233-241
15. Goemans, M.X., Kleinberg, J.: The Lovasz theta function and a semidefinite programming relaxation of vertex cover. SIAM J. on Discrete Math. 11 (1998) 1-48
16. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfyability problems using semidefinite programming. J. ACM 42 (1995) 1115-1145.
17. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer (1988)
18. 1-ε. Proc. 37th FOCS (1996) 627-636
19. Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley (2000)
20. Juhász, F.: The asymptotic behaviour of Lovász θ function for random graphs. Combinatorica 2 (1982) 269-270
21. Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM 45 (1998) 246-265
22. Knuth, D.: The sandwich theorem, Electron. J. Combin. 1 (1994)
23. Krivelevich, M.: Deciding k-colorability in expected polynomial time, Information Processing Letters 81 (2002), 1-6
24. Krivelevich, M., Vu, V.H.: Approximating the independence number and the chromatic number in expected polynomial time. J. of Combinatorial Optimization 6 (2002) 143-155
25. Lawler, E.L.: A note on the complexity of the chromatic number problem, Information Processing Letters 5 (1976) 66-67
26. Luczak, T.: A note on the sharp concentration of the chromatic number of random graphs. Combinatorica 11 (1991) 45-54
27. n,p. Combinatorica 7 (1987) 121-129
28. Szegedy, M.: A note on the θ number of Lovász and the generalized Delsarte bound. Proc. 35th FOCS (1994) 36-39