-
Seunghun Lee (이승훈), On colorings of hypergraphs embeddable in $\mathbb{R}^d$
Seunghun Lee (이승훈), On colorings of hypergraphs embeddable in $\mathbb{R}^d$
Given a hypergraph $H=(V,E)$, we say that $H$ is (weakly) $m$-colorable if there is a coloring $c:V\to $ such that every hyperedge of $H$ is not monochromatic. The (weak) chromatic number of $H$, denoted by $\chi(H)$, is the smallest $m$ such that $H$ is $m$-colorable. A vertex subset $T \subseteq V$ is called a transversal …