The hardness of 3-uniform hypergraph coloring

Annual Symposium on Foundations of Computer Science-Proceedings

Volumn , Issue , 2002, Pages 33-40

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

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

CHROMATIC NUMBER; HYPERGRAPH; KNESER GRAPH; SCHRIJVER GRAPH;

GRAPH THEORY;

EID: 0036953855     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2002.1181880     Document Type: Article

References (27)

1. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
2. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998.
3. I. Bárány. A short proof of Kneser's conjecture. J. Combin. Theory Ser. A, 25(3):325-326, 1978.
4. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal on Computing, 27(3):804-915, June 1998.
5. 3/14)-coloring algorithm for 3-colorable graphs. IPL: Information Processing Letters, 61, 1997.
6. I. Dinur, V. Guruswami, S. Khot, and O. Regev. Vertex cover on k-uniform hypergraphs is NP-hard to approximate to within k-1-ε. Manuscript, 2002.
7. I. Dinur and S. Safra. On the importance of being biased. In Proc. 34th ACM Symp. on Theory of Computing, 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. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity (CCC-96), pages 278-289, Los Alamitos, May 24-27 1996. IEEE Computer Society.
10. P. Frankl and Z. Füredi. Extremal problems concerning Kneser graphs. J. Combin. Theory Ser. B, 40(3):270-284, 1986.
11. Michel X. Goemans and David P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. Assoc. Comput. Mach., 42:1115-1145, 1995.
12. J. E. Greene. A new short proof of Kneser's conjecture. Manuscript, to appear in Amer. Math. Monthly, 2002.
13. V. Guruswami and S. Khanna. On the hardness of 4-coloring a 3-colorable graph. In Proceedings of the 15th Annual IEEE Conference on Computational Colmplexity (COCO-00), pages 188-197, Los Alamitos, CA, July 4-7 2000. IEEE Press.
14. V. Guruswami, J. Håstad, and M. Sudan. Hardness of approximate hypergraph coloring. In Proc. 41st IEEE Symp. on Foundations of Computer Science, pages 149-158. IEEE Computer Society Press, 2000.
15. Venkatesan Guruswami. Inapproximability results for set splitting and satisfiability problems with no mixed clauses. In Approx, pages 155-166, 2000.
16. Johan Håstad. Some optimal inapproximability results. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 1-10, El Paso, Texas, 4-6 May 1997.
17. Sanjeev Khanna Nathan Linial, and Shmuel Safra. On the hardness of approximating the chromatic number. Combinatorica, 20(3):393-415, 2000.
18. Subhash Khot. 3-colorable 3-uniform hypergraphs are hard to color with constantly many colors. 2002.
19. M. Kneser. Aufgabe 360. Jahresbericht der Deutschen Mathematiker-Vereinigung, 58(2), Abetilung, S. 27, 1955.
20. Krivelevich, Nathaniel, and Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. Algorithms: Journal of Algorithms, 41, 2001.
21. Krivelevich and Sudakov. Approximate coloring of uniform hypergraphs. In ESA: Annual European Symposium on Algorithms, 1998.
22. L. Lovász. Kneser's conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A, 25(3):319-324, 1978.
23. J. Matoušek. A combinatorial proof of Kneser's conjecture. Combinatorica, to appear.
24. J. Matoušek. Topological methods in combinatorics and geometry. Book in preparation.
25. Ran Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
26. A. Schrijver. Vertex-critical subgraphs of Kneser graphs. Nieuw Arch. Wisk. 26(3):454-461, 1978.
27. Uri Zwick. Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to Max Cut and other problems. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), pages 679-687, New York, May 1999. Association for Computing Machinery.