1 problem

Let $\mathcal{H}$ be a hypergraph family, and let $m_\mathcal{H}(k)$ denote the minimum number of vertices needed to guarantee a polychromatic $k$-coloring in the relevant hypergra…