Suppose we are given matchings M1,....,MN of size t in some
r-uniform hypergraph, and let us think of each matching having a
different color. How large does N need to be (in terms of t and r)
such that we can always find a rainbow matching of size t...