Rutgers Discrete Mathematics Seminar

Title: On the hardness of coloring rainbow-colorable hypergraphs

Speaker: Aditya Potukuchi, Rutgers University

Date: Monday, April 2, 2018 2:00 pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


A (uniform) hypergraph is c-colorable if its vertices can be assigned colors from 1,...,c so that no hyperedge is monochromatic. A hypergraph is r-rainbow colorable (or r-polychromatic) if its vertices can be assigned colors from 1,...,r so that every edge has all r colors. It is very easy to see that if a hypergraph is r-rainbow colorable for r \geq 2, then it is 2-colorable. However, given a hypergraph with the promise that is r-rainbow colorable for r \geq 2, finding an efficient algorithm that outputs a proper 2-coloring of it does not always seem to be an easy problem. This result shows that finding a c-coloring of a k-uniform, k(1 - o_c(1))-rainbow colorable hypergraph is NP-hard. The gadgets involved in the reduction are some kinds of variations/generalizations of the Kneser hypergraph, some of which seem to be well studied, and some which are not (as far as we know).

Joint work with Per Austrin and Amey Bhangale.