Clemens, DennisDennisClemensEhrenmüller, JuliaJuliaEhrenmüller2020-04-282020-04-282016-04-15Electronic Journal of Combinatorics 2 (23): P2.11 (2016-04-15)http://hdl.handle.net/11420/5949A conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains a rainbow matching of size n. In this paper we prove that matching sizes of (3/2 + o(1))n suffice to guarantee such a rainbow matching, which is asymptotically the same bound as the best-known one in the case where we only aim to find a rainbow matching of size n – 1. This improves previous results by Aharoni, Charbit and Howard, and Kotlar and Ziv.en2156-352720162Bipartite graphsRainbow matchingsJournal ArticleOther