Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs

Details Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs

2011-08-11

arxiv.org/abs/1108.2521v1

Mathematics

Combinatorics

Scientific paper

A {\it 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; f(\delta) = 6.5\delta suffices. Furthermore, the proof provides a O(\delta(G)|V(G)|^2)-time algorithm that generates such a matching.

Affiliated with

Also associated with

No associations

Rating

Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15709