Hardness of Rainbow Coloring Hypergraphs

A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each hyperedge has all the k colors. Unlike usual hypergraph coloring, rainbow coloring becomes harder as the number of colors increases. This work studies the rainbow colorability of hypergraphs which are guaranteed to be nearly balanced rainbow colorable. Specifically, we show that for any Q,k >= 2 and \ell <= k/2, given a Qk-uniform hypergraph which admits a k-rainbow coloring satisfying: - in each hyperedge e, for some \ell_e <= \ell all but 2\ell_e colors occur exactly Q times and the rest (Q +/- 1) times, it is NP-hard to compute an independent set of (1 - (\ell+1)/k + \eps)-fraction of vertices, for any constant \eps > 0. In particular, this implies the hardness of even (k/\ell)-rainbow coloring such hypergraphs. The result is based on a novel long code PCP test that ensures the strong balancedness property desired of the k-rainbow coloring in the completeness case. The soundness analysis relies on a mixing bound based on uniform reverse hypercontractivity due to Mossel, Oleszkiewicz, and Sen, which was also used in earlier proofs of the hardness of \omega(1)-coloring 2-colorable 4-uniform hypergraphs due to Saket, and k-rainbow colorable 2k-uniform hypergraphs due to Guruswami and Lee.

[1]  Venkatesan Guruswami,et al.  PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[2]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[3]  Venkatesan Guruswami,et al.  (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..

[4]  Sangxia Huang $2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring , 2015, Electron. Colloquium Comput. Complex..

[5]  Venkatesan Guruswami,et al.  Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs , 2018, Comb..

[6]  Venkatesan Guruswami,et al.  Super-polylogarithmic hypergraph coloring hardness via low-degree long codes , 2013, STOC.

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

[8]  Aleksandar Nikolov,et al.  Tight hardness results for minimizing discrepancy , 2011, SODA '11.

[9]  Subhash Khot,et al.  Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[11]  Béla Bollobás,et al.  Cover-Decomposition and Polychromatic Numbers , 2011, ESA.

[12]  Ken-ichi Kawarabayashi,et al.  Combinatorial Coloring of 3-Colorable Graphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[13]  Rishi Saket Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[14]  Shachar Lovett,et al.  Constructive Discrepancy Minimization by Walking on the Edges , 2012, FOCS.

[15]  Subhash Khot On the power of unique 2-prover 1-round games , 2002, STOC '02.

[16]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

[18]  Uri Zwick,et al.  Coloring k-colorable graphs using relatively small palettes , 2002, J. Algorithms.

[19]  Elchanan Mossel Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.

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

[21]  W. Marsden I and J , 2012 .

[22]  Irit Dinur,et al.  The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..

[23]  Subhash Khot,et al.  Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors , 2014, Electron. Colloquium Comput. Complex..

[24]  Béla Bollobás,et al.  Cover-Decomposition and Polychromatic Numbers , 2010, SIAM J. Discret. Math..

[25]  Subhash Khot,et al.  Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs , 2014, SODA.

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

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

[28]  Sanjeev Arora,et al.  New approximation guarantee for chromatic number , 2006, STOC '06.

[29]  Elchanan Mossel,et al.  On Reverse Hypercontractivity , 2011, Geometric and Functional Analysis.

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

[31]  C. Umans Hardness of Approximating p 2 Minimization Problems , 1999 .

[32]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[33]  Noga Alon,et al.  Approximate Hypergraph Coloring , 1996, Nord. J. Comput..

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

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

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

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

[38]  Girish Varma Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions , 2015, Chic. J. Theor. Comput. Sci..

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

[40]  Avrim Blum,et al.  New approximation algorithms for graph coloring , 1994, JACM.

[41]  Venkatesan Guruswami,et al.  The Quest for Strong Inapproximability Results with Perfect Completeness , 2021, Electron. Colloquium Comput. Complex..