24 research outputs found
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 2ell_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
The Quest for Strong Inapproximability Results with Perfect Completeness
The Unique Games Conjecture (UGC) has pinned down the approximability of all constraint satisfaction problems (CSPs), showing that a natural semidefinite programming relaxation offers the optimal worst-case approximation ratio for any CSP. This elegant picture, however, does not apply for CSP instances that are perfectly satisfiable, due to the imperfect completeness inherent in the UGC. For the important case when the input CSP instance admits a satisfying assignment, it therefore remains wide open to understand how well it can be approximated.
This work is motivated by the pursuit of a better understanding of the inapproximability of perfectly satisfiable instances of CSPs. Our main conceptual contribution is the formulation of a (hypergraph) version of Label Cover which we call "V label cover." Assuming a conjecture concerning the inapproximability of V label cover on perfectly satisfiable instances, we prove the following implications:
* There is an absolute constant c0 such that for k >= 3, given a satisfiable instance of Boolean k-CSP, it is hard to find an assignment satisfying more than c0 k^2/2^k fraction of the constraints.
* Given a k-uniform hypergraph, k >= 2, for all epsilon > 0, it is hard to tell if it is q-strongly colorable or has no independent set with an epsilon fraction of vertices, where q = ceiling[k + sqrt(k) - 0.5].
* Given a k-uniform hypergraph, k >= 3, for all epsilon > 0, it is hard to tell if it is (k-1)-rainbow colorable or has no independent set with an epsilon fraction of vertices.
We further supplement the above results with a proof that an ``almost Unique\u27\u27 version of Label Cover can be approximated within a constant factor on satisfiable instances
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes. Given as input such a hypergraph, finding a r-rainbow coloring of it is NP-hard for all k >= 3 and r >= 2. Therefore, one settles for finding a rainbow coloring with fewer colors (which is an easier task). When r=k (the maximum possible value), i.e., the hypergraph is k-partite, one can efficiently 2-rainbow color the hypergraph, i.e., 2-color its vertices so that there are no monochromatic edges. In this work we consider the next smaller value of r=k-1, and prove that in this case it is NP-hard to rainbow color the hypergraph with q := ceil[(k-2)/2] colors. In particular, for k <=6, it is NP-hard to 2-color (k-1)-rainbow colorable k-uniform hypergraphs.
Our proof follows the algebraic approach to promise constraint satisfaction problems. It proceeds by characterizing the polymorphisms associated with the approximate rainbow coloring problem, which are rainbow colorings of some product hypergraphs on vertex set [r]^n. We prove that any such polymorphism f: [r]^n -> [q] must be C-fixing, i.e., there is a small subset S of C coordinates and a setting a in [q]^S such that fixing x_{|S} = a determines the value of f(x). The key step in our proof is bounding the sensitivity of certain rainbow colorings, thereby arguing that they must be juntas. Armed with the C-fixing characterization, our NP-hardness is obtained via a reduction from smooth Label Cover
Derandomized Graph Product Results using the Low Degree Long Code
In this paper, we address the question of whether the recent derandomization
results obtained by the use of the low-degree long code can be extended to
other product settings. We consider two settings: (1) the graph product results
of Alon, Dinur, Friedgut and Sudakov [GAFA, 2004] and (2) the "majority is
stablest" type of result obtained by Dinur, Mossel and Regev [SICOMP, 2009] and
Dinur and Shinkar [In Proc. APPROX, 2010] while studying the hardness of
approximate graph coloring.
In our first result, we show that there exists a considerably smaller
subgraph of which exhibits the following property (shown for
by Alon et al.): independent sets close in size to the
maximum independent set are well approximated by dictators.
The "majority is stablest" type of result of Dinur et al. and Dinur and
Shinkar shows that if there exist two sets of vertices and in
with very few edges with one endpoint in and another in
, then it must be the case that the two sets and share a single
influential coordinate. In our second result, we show that a similar "majority
is stablest" statement holds good for a considerably smaller subgraph of
. Furthermore using this result, we give a more efficient
reduction from Unique Games to the graph coloring problem, leading to improved
hardness of approximation results for coloring