A note on hardness of promise hypergraph colouring
Abstract
We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all c ≥ 2, it is NP-hard to find a c-colouring of a 2-coloruable 3-uniform hypergraph. We recast this result in the algebraic framework for Promise CSPs, using only a weaker version of the PCP theorem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.