Approximate Hypergraph Coloring under Low-discrepancy and Related Promises

Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee

A hypergraph is said to be $\chi$-colorable if its vertices can be colored with $\chi$ colors so that no hyperedge is monochromatic. $2$-colorability is a fundamental property (called Pr…