{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:42:48Z","timestamp":1787323368005,"version":"build-2736575974"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["647678."],"award-info":[{"award-number":["647678."]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$ colors with at least $n + 1$ edges of each color there must be a matching that uses each color exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities $o(n)$ that is properly edge-colored by $n$ colors with at least $n + o(n)$ edges of each color there must be a matching of size $n-O(1)$ that uses each color at most once.<\/jats:p>","DOI":"10.1137\/17m1151742","type":"journal-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T15:08:06Z","timestamp":1531235286000},"page":"1577-1584","source":"Crossref","is-referenced-by-count":6,"title":["Rainbow Matchings in Properly Colored Multigraphs"],"prefix":"10.1137","volume":"32","author":[{"given":"Peter","family":"Keevash","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liana","family":"Yepremyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"key":"atypb1","first-page":"16","author":"Aharoni R.","year":"2009","journal-title":"Electron. J. Combin."},{"key":"atypb2","unstructured":"J. Bara\u0301t, A. Gya\u0301rfa\u0301s, and G.N. Sa\u0301rko\u0308zy,\n                      Rainbow Matchings in Bipartite Multigraphs\n                      , arXiv:1505.01779."},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"R. A. Brualdi and H. J. Ryser,\n                      Combinatorial Matrix Theory\n                      , Cambridge University Press, Cambridge, 1991.","DOI":"10.1017\/CBO9781107325708"},{"key":"atypb4","unstructured":"P. Gao, R. Ramadurai, I. Wanless, and N. Wormald,\n                      Full Rainbow Matchings in Graphs and Hypergraphs\n                      , arXiv:1709.02665."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.01.002"},{"key":"atypb6","unstructured":"A. Pokrovskiy,\n                      An Approximate Version of a Conjecture of Aharoni and Berger\n                      , arXiv:1609.06346."},{"key":"atypb7","unstructured":"A. Pokrovskiy and B. Sudakov,\n                      A Counterexample to Stein's Equi-$n$-square Conjecture\n                      , arXiv:1711.00429."},{"key":"atypb8","first-page":"69","author":"Ryser H.","year":"1967","journal-title":"Oberwolfach"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.59.567"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"I. M. Wanless,\n                      Transversals in Latin squares: A Survey\n                      , Surveys in Combinatorics, Cambridge University Press, Cambridge, 2011.","DOI":"10.1017\/CBO9781139004114.010"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1151742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:58:26Z","timestamp":1787320706000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1151742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1151742"],"URL":"https:\/\/doi.org\/10.1137\/17m1151742","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}