A note on rainbow matchings in properly edge-coloured graphs

Abstract

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.

Cited by in corpus (3)

• Large rainbow matchings in large graphs
• Rainbow matchings and partial transversals of Latin squares
• A note on large rainbow matchings in edge-coloured graphs