{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:52Z","timestamp":1753893832374,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function $f(\\delta)$ such that a properly edge-colored graph $G$ with minimum degree $\\delta$ and order at least $f(\\delta)$ must have a rainbow matching of size $\\delta$. We answer this question in the affirmative; an extremal approach yields that $f(\\delta) = 98\\delta\/23&lt; 4.27\\delta$ suffices. Furthermore, we give an $O(\\delta(G)|V(G)|^2)$-time algorithm that generates such a matching in a properly edge-colored graph of order at least $6.5\\delta$.\u00a0<\/jats:p>","DOI":"10.37236\/2443","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:27:00Z","timestamp":1578713220000},"source":"Crossref","is-referenced-by-count":11,"title":["Rainbow Matchings of Size $\\delta(G)$ in Properly Edge-Colored Graphs"],"prefix":"10.37236","volume":"19","author":[{"given":"Jennifer","family":"Diemunsch","sequence":"first","affiliation":[]},{"given":"Michael","family":"Ferrara","sequence":"additional","affiliation":[]},{"given":"Allan","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Casey","family":"Moffatt","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Pfender","sequence":"additional","affiliation":[]},{"given":"Paul S","family":"Wenger","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2012,6,28]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p52\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p52\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:33:05Z","timestamp":1579300385000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i2p52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,28]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2012,4,7]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.37236\/2443","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2012,6,28]]},"article-number":"P52"}}