Cooperative conditions for the existence of rainbow matchings

Ron Aharoni, Joseph Briggs, Minho Cho +1

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of siz…