@article {IOPORT.05960024,
    author       = {Wang, Guanghui},
    title        = {Rainbow matchings in properly edge colored graphs.},
    year         = {2011},
    journal      = {The Electronic Journal of Combinatorics [electronic only]},
    volume       = {18},
    number       = {1},
    issn         = {1077-8926},
    pages        = {Research Paper P162, 7 p., electronic only},
    publisher    = {Prof. Andr\'e K\"undgen, Deptartment of Mathematics, California State University San Marcos, San Marcos, CA},
    abstract     = {Summary: 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 $.},
    identifier   = {05960024},
}