, Volume 25, Issue 5, pp 519–535 | Cite as

The Hardness of 3-Uniform Hypergraph Coloring

  • Irit Dinur*
  • Oded Regev†
  • Clifford Smyth‡
Original Paper

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(n 1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c 2 > c 1 > 1, coloring a k-uniform c 1-colorable hypergraph with c 2 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.

Mathematics Subject Classification (2000):



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringThe Hebrew University of JerusalemJerusalem 91904Israel
  2. 2.Department of Computer ScienceTel-Aviv UniversityTel-Aviv 69978Israel
  3. 3.Department of MathematicsCarnegie Mellon UniversityPittsburgh, PA 15213-3890USA

Personalised recommendations