{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:19:38Z","timestamp":1758824378574,"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>Let $G$ be a properly edge colored graph. A rainbow matching of $G$ is a matching in which no two edges have the same color. Let $\\delta$ denote the minimum degree of $G$. We show that if $|V(G)|\\geq \\frac{8\\delta}{5}$, then $G$ has a rainbow matching of size at least $\\lfloor\\frac {3 \\delta }{5}\\rfloor$. We also prove that if $G$ is a properly colored triangle-free graph, then $G$ has a rainbow matching of size at least $\\lfloor\\frac {2 \\delta }{3}\\rfloor$.<\/jats:p>","DOI":"10.37236\/649","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:43:15Z","timestamp":1578696195000},"source":"Crossref","is-referenced-by-count":16,"title":["Rainbow Matchings in Properly Edge Colored Graphs"],"prefix":"10.37236","volume":"18","author":[{"given":"Guanghui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,8,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p162\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p162\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:07:17Z","timestamp":1579284437000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,5]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/649","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,8,5]]},"article-number":"P162"}}