A note on rainbow matchings in properly edge-coloured graphs

preprint2011arXivOpen access

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δ(G) -5)/2$ has a rainbow matching of size $δ(G)$ , improving a result of Diemunsch et al.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

A note on rainbow matchings in properly edge-coloured graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0