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.
Cite
@article{arxiv.2205.14719,
title = {A note on hardness of promise hypergraph colouring},
author = {Marcin Wrochna},
journal= {arXiv preprint arXiv:2205.14719},
year = {2025}
}