A NOTE ON RAINBOW MATCHINGS
2013
Let G be a d-regular properly edge-colored graph such that the edges with the same color induce a 1-factor of G. A rainbow matching of G is a matching in which no two edges have the same color. We show that if the order n of G is at least 3.79d, then G has a rainbow matching of size d.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
1
Citations
NaN
KQI