The hardness of 3-uniform hypergraph coloring

Combinatorica

Volumn 25, Issue 5, 2005, Pages 519-535

  Dinur, Irit ^a   Regev, Oded ^b   Smyth, Clifford ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646194148     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-005-0032-4     Document Type: Article

References (27)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN and M. SZEGEDY: Proof verification and the hardness of approximation problems, J. ACM 45(3) (1998), 501-555.
2. S. AHORA and S. SAFRA: Probabilistic checking of proofs: a new characterization of NP, J. ACM 45(1) (1998), 70-122.
3. I. BÁRÁNY: A short proof of Kneser's conjecture, J. Combin. Theory Ser. A 25(3) (1978), 325-326.
4. M. BELLARE, O. GOLDREICH and M. SUDAN: Free bits, PCPs, and nonapproximability - towards tight results: SIAM J. Comput. 27(3) (1998), 804-915.
5. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61(1) (1997), 49-53.
6. I. DINUR, V. GURUSWAMI, S. KHOT and O. REGEV: A new multilayered PCP and the hardness of hypergraph vertex cover, in Proc. 35th ACM Symp. on Theory of Computing (STOC), pages 595-601, 2003.
7. I. DINUR and S. SAFRA: The importance of being biased, in Proc. 34th ACM Symp. on Theory of Computing (STOC), pages 33-42, 2002.
8. V. L. DOL'NIKOV: Transversals of families of sets, in Studies in the theory of functions of several real variables (Russian), pages 30-36, 109. Yaroslav. Gos. Univ., Yaroslavl', 1981.
9. U. FEIGE and J. KILIAN: Zero knowledge and the chromatic number, J. Comput. System Sci. 57(2) (1998), 187-199.
10. P. FRANKL and Z. FÜREDI: Extremal problems concerning Kneser graphs, J. Combin. Theory Ser. B 40(3) (1986), 270-284.
11. M. X. GOEMANS and D. P. WILLIAMSON: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach. 42(6) (1995), 1115-1145.
12. J. E. GREENE: A new short proof of Kneser's conjecture, Amer. Math. Monthly 109(10) (2002), 918-920.
13. V. GURUSWAMI: Inapproximability results for set splitting and satisfiability problems with no mixed clauses, in Approximation algorithms for combinatorial optimization (Saarbrücken. 2000), volume 1913 of Lecture Notes in Comput. Sci., pages 155-166, Springer, Berlin, 2000.
14. V. GURUSWAMI, J. HÅSTAD and M. SUDAN: Hardness of approximate hypergraph coloring, SIAM J. Comput. 31(6) (2002), 1663-1686.
15. V. GURUSWAMI and S. KHANNA: On the hardness of 4-coloring a 3-colorable graph, in 15th Annual IEEE Conference on Computational Complexity (Florence. 2000), pages 188-197, IEEE Computer Soc., Los Alamitos, CA, 2000.
16. J. HÅSTAD: Some optimal inapproximability results, J. ACM 48(4) (2001), 798-859.
17. S. KHANNA, N. LINIAL and S. SAFRA: On the hardness of approximating the chromatic number, Combinatorica 20(3) (2000), 393-415.
18. S. KHOT: Hardness of coloring 3-colorable 3-uniform hypergraphs, in Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 23-32, 2002.
19. M. KNESER: Aufgabe 360, Jahresbericht der Deutschen Mathematiker- Vereinigung 58(2) (1955), Abteilung, S. 27.
20. M. KRIYELEVICH, R. NATHANIEL and B. SUDAKOV: Approximating coloring and maximum independent sets in 3-uniform hypergraphs, J. Algorithms 41(1) (2001), 99-113.
21. M. KRIVELEYICH and B. SUDAKOV: Approximate coloring of uniform hypergraphs, J. Algorithms 49(1) (2003), 2-12.
22. L. LOVÁSZ: Kneser's conjecture, chromatic number, and homotopy; J. Combin. Theory Ser. A 25(3) (1978), 319-324.
23. J. MATOUŠEK: Using the Borsuk-Ulam theorem, Universitext, Springer-Verlag, Berlin, 2003. Lectures on topological methods in combinatorics and geometry, written in cooperation with Anders Björner and Günter M. Ziegler.
24. J. MATOUŠEK: A combinatorial proof of Kneser's conjecture, Combinatorica 24(1) (2004), 163-170.
25. R. RAZ: A parallel repetition theorem, SIAM J. Comput. 27(3) (1998), 763-803.
26. A. SCHRIJVER: Vertex-critical subgraphs of Kneser graphs, Nieuw Arch. Wisk. (3) 26(3) (1978), 454-461.
27. U. ZWICK: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems; in Annual ACM Symposium on Theory of Computing (Atlanta. GA. 1999), pages 679-687, ACM, New York, 1999.