  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.
