Hardness of Coloring 2-Colorable 3-Uniform Hypergraphs with(1) n Colors

arXiv:2610.37869 · cs.CC · Submitted 2026-10-27 · Read on arXiv

cs.CC

Submitted: 2026-10-27

Updated: 2026-10-27

Comments: 20 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: We show that it is quasi-NP-hard to color a 2-colorable 3-uniform hypergraph on n vertices using O((n) 1/8) colors.

Terminology

Abstract

We show that it is quasi-NP-hard to color a 2-colorable 3-uniform hypergraph on n vertices using O((n) 1/8) colors. This exponentially improves the result of Dinur, Regev, and Smyth [Combinatorica'2005], which showed it is quasi-NP-hard to color a 2-colorable 3-uniform hypergraph on n vertices using O((n) 1/3) colors.

Related papers