Simplified inpproximability of hypergraph coloring via t-agreeing families

Per Austrin, Amey Bhangale, Aditya Potukuchi. Simplified inpproximability of hypergraph coloring via t-agreeing families. Electronic Colloquium on Computational Complexity (ECCC), 26:48, 2019. [doi]

Abstract

Abstract is missing.