The Hardness of 3-Uniform Hypergraph Coloring

We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; the case k = 2, however, remains wide open.This is the first hardness result for approximately-coloring a 3-uniform hypergraph that is colorable with a constant number of colors. For k ≥ 4 such a result has been shown by [14], who also discussed the inherent difference between the k = 3 case and k ≥ 4.Our proof presents a new connection between the Long-Code and the Kneser graph, and relies on the high chromatic numbers of the Kneser graph [19,22] and the Schrijver graph [26]. We prove a certain maximization variant of the Kneser conjecture, namely that any coloring of the Kneser graph by fewer colors than its chromatic number, has ‘many’ non-monochromatic edges.

[1]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[2]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[4]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[5]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[6]  Venkatesan Guruswami.  Query-efficient checking of proofs and improved PCP characterizations of NP , 1999 .

[7]  Benny Sudakov,et al.  Approximating coloring and maximum independent sets in 3-uniform hypergraphs , 2001, SODA '01.

[8]  Imre Bárány,et al.  A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.

[9]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[10]  Venkatesan Guruswami,et al.  Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses , 2004, Algorithmica.

[11]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[12]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[13]  Jonas Holmerin.  Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.

[14]  Venkatesan Guruswami,et al.  The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses , 1999, Electron. Colloquium Comput. Complex..

[15]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[16]  Zoltán Füredi,et al.  Extremal problems concerning Kneser graphs , 1986, J. Comb. Theory, Ser. B.

[17]  J. Beck,et al.  On 3-chromatic hypergraphs , 1978, Discret. Math..

[18]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[19]  Jacques Stern,et al.  The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..

[20]  Joshua Evan Greene,et al.  A New Short Proof of Kneser's Conjecture , 2002, Am. Math. Mon..

[21]  Alan M. Frieze,et al.  Coloring Bipartite Hypergraphs , 1996, IPCO.

[22]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[23]  Venkatesan Guruswami,et al.  On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..

[24]  Lars Engebretsen,et al.  Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT , 1998, Inf. Process. Lett..

[25]  Venkatesan Guruswami,et al.  A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[26]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[27]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.

[28]  David R. Karger,et al.  An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.

[29]  J. Matousek,et al.  Using The Borsuk-Ulam Theorem , 2007 .

[30]  P. Erdos.  On a combinatorial problem. II , 1964 .

[31]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[32]  Eth Zentrum,et al.  A Combinatorial Proof of Kneser's Conjecture , 2022 .

[33]  Colin McDiarmid,et al.  A Random Recolouring Method for Graphs and Hypergraphs , 1993, Combinatorics, Probability and Computing.

[34]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[35]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

[36]  Noga Alon,et al.  Coloring 2-colorable hypergraphs with a sublinear number of colors , 1996 .

[37]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[38]  Colin McDiarmid,et al.  Hypergraph colouring and the Lovász Local Lemma , 1997, Discret. Math..

[39]  Subhash Khot.  Hardness results for approximate hypergraph coloring , 2002, STOC '02.

[40]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[41]  A. Schrijver,et al.  Vertex-critical subgraphs of Kneser-graphs , 1978 .

[42]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[43]  Phokion G. Kolaitis.  Hardness Of Approximations , 1996 .

[44]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[45]  Benny Sudakov,et al.  Approximate coloring of uniform hypergraphs , 1998, J. Algorithms.

[46]  Joel H. Spencer,et al.  Coloring n-Sets Red and Blue , 1981, J. Comb. Theory, Ser. A.