On colorings of hypergraphs embeddable in ${\mathbb{R}}^d$

Seunghun Lee, Eran Nevo

The (weak) chromatic number of a hypergraph $H$, denoted by $\chi (H)$, is the smallest number of colors required to color the vertices of $H$ so that no hyperedge of $H$ is monochroma…