1. New challenges in the theory of hypergraph coloring;Bacsó,2008
2. Efficient proper 2-coloring of almost disjoint hypergraphs;Beck,2002
3. PCPs via low-degree long code and hardness for constrained hypergraph coloring;Dinur,2013
4. The hardness of 3-uniform hypergraph coloring;Dinur;Combinatorica,2005
5. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes;Guruswami,2014