{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:10Z","timestamp":1777539970864,"version":"3.51.4"},"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>A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors.  The color degree of a vertex $v$ is the number of different colors on edges incident to $v$.  Wang and Li conjectured that for $k\\geq 4$, every edge-colored graph with minimum color degree at least $k$ contains a rainbow matching of size at least $\\left\\lceil k\/2 \\right\\rceil$.  We prove the slightly weaker statement that a rainbow matching of size at least $\\left\\lfloor k\/2 \\right\\rfloor$ is guaranteed.  We also give sufficient conditions for a rainbow matching of size at least $\\left\\lceil k\/2 \\right\\rceil$ that fail to hold only for finitely many exceptions (for each odd $k$).<\/jats:p>","DOI":"10.37236\/475","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:13:21Z","timestamp":1578716001000},"source":"Crossref","is-referenced-by-count":21,"title":["Rainbow Matching in Edge-Colored Graphs"],"prefix":"10.37236","volume":"17","author":[{"given":"Timothy D.","family":"LeSaulnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Stocker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul S.","family":"Wenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2010,5,14]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n26\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n26\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:53:33Z","timestamp":1579305213000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1n26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,14]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/475","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,14]]},"article-number":"N26"}}