{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:25Z","timestamp":1753893865244,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Aharoni and Berger conjectured that every collection of $n$ matchings of size $n+1$ in a bipartite graph contains a rainbow matching of size $n$. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are much larger than $n+1$. The best bound is currently due to Aharoni, Kotlar, and Ziv who proved the conjecture when the matchings are of size at least $3n\/2+1$. When the matchings are all edge-disjoint and perfect, the best result follows from a theorem of H\u00e4ggkvist and Johansson which implies the conjecture when the matchings have size at least $n+o(n)$. In this paper we show that the conjecture is true when the matchings have size $n+o(n)$ and are all edge-disjoint (but not necessarily perfect). We also give an alternative argument to prove the conjecture when the matchings have size at least $\\phi n+o(n)$ where $\\phi\\approx 1.618$ is the Golden Ratio.Our proofs involve studying connectedness in coloured, directed graphs. The notion of connectedness that we introduce is new, and perhaps of independent interest.<\/jats:p>","DOI":"10.37236\/5246","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T14:32:32Z","timestamp":1578666752000},"source":"Crossref","is-referenced-by-count":6,"title":["Rainbow Matchings and Rainbow Connectedness"],"prefix":"10.37236","volume":"24","author":[{"given":"Alexey","family":"Pokrovskiy","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,2,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p13\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:06:03Z","timestamp":1579219563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/5246","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,3]]},"article-number":"P1.13"}}