Large matchings in bipartite graphs have a rainbow matching

Daniel Kotlar, Ran Ziv

Let $g(n)$ be the least number such that every collection of $n$ matchings, each of size at least $g(n)$, in a bipartite graph, has a full rainbow matching. Aharoni and Berger \cit…