Özkahya–Young anti-Ramsey matching conjecture

Let $ar(n,k,s)$ be the least number of nonempty color classes in a coloring (partition) of ${[n]\choose k}$ that guarantees a rainbow $s$-matching, meaning $s$ pairwise disjoint $k$-sets belonging to pairwise distinct color classes. Let $e_k(n,s-1)$ denote the maximum size of a $k$-uniform family in $[n]$ with matching number less than $s-1$. Özkahya–Young anti-Ramsey matching conjecture. For all $n>sk$,

$$ar(n,k,s)=e_k(n,s-1)+2.$$

This conjecture connects anti-Ramsey numbers with extremal matching problems; the supplied source gives no resolution or partial-result status.