Allan Lo
Published 2011-08-26Version 1
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.
Rainbow matchings and rainbow connectedness
On sets not belonging to algebras and rainbow matchings in graphs
Rainbow matchings in bipartite multigraphs
![QR code for arXiv:1108.5273 [math.CO]](http://oss.arxitics.com/images/favicon.svg)