Seminars and Colloquiums

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 …