Simplified inpproximability of hypergraph coloring via t-agreeing families

Per Austrin, Amey Bhangale, Aditya Potukuchi

We reprove the results on the hardness of approximating hypergraph coloring using a different technique based on bounds on the size of extremal $t$-agreeing families of $[q{]}^n$. Sp…