1 problem

Let $H$ be an $r$-partite hypergraph containing at least one edge, and let $\nu(H)$ denote its matching number, the maximum number of pairwise disjoint edges. For a set $S$ of vert…