# Talk:Rainbow matchings in bipartite graphs

A possible strengthening of the conjecture would be to consider t matchings of size k+1 and k-t matchings of size k. This paper of Barát and Wanless shows that t cannot be smaller than $\lfloor k/2 \rfloor$.