Sciweavers

Share
FOCS
2002
IEEE

The Hardness of 3 - Uniform Hypergraph Coloring

8 years 8 months ago
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-mo...
Irit Dinur, Oded Regev, Clifford D. Smyth
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where FOCS
Authors Irit Dinur, Oded Regev, Clifford D. Smyth
Comments (0)
books