Rainbow matchings in $k$-partite hypergraphs

In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families $\mathcal F_1,\ldots, \mathcal F_s$oftuplesin${1,\ldots, n}^k$,provided$s\ge 470.$