Erdős Problem #780 — The chromatic number of Kneser hypergraphs

Let $n,k,r,t$ be positive integers with $n≥kr+(t-1)(k-1)$. If the $r$-element subsets of an $n$-element set are coloured with $t$ colours, must some colour contain $k$ pairwise disjoint sets?