A note on rainbow matchings in properly edge-coloured graphs

Details A note on rainbow matchings in properly edge-coloured graphs A note on rainbow matchings in properly edge-coloured graphs

2011-08-26

arxiv.org/abs/1108.5273v1

Mathematics

Combinatorics

Scientific paper

A rainbow matching in an edge-coloured graph is a matching such that its
edges have distinct colours. We show that every properly edge-coloured graph
$G$ with $|G| \ge (9\delta(G) -5)/2$ has a rainbow matching of size
$\delta(G)$, improving a result of Diemunsch et al.

Affiliated with

Also associated with

No associations

Rating

A note on rainbow matchings in properly edge-coloured 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 A note on rainbow matchings in properly edge-coloured graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on rainbow matchings in properly edge-coloured graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501981