A note on hardness of promise hypergraph colouring

Marcin Wrochna

We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all $c\ge 2$, it is NP-hard to find a $c$-colouring of a 2-coloruable 3-uniform hy…