A note on rainbow matchings in strongly edge-colored graphs

The Ryser Conjecture which states that there is a transversal of size $n$ in a Latin square of odd order $n$ is equivalent to finding a rainbow matching of size $n$ in a properly edge-colored $K_{n,n}$ using $n$ colors when $n$ is odd. Let $\delta$ be the minimum degree of a graph. Wang proposed a more general question to find a function $f\left(\delta \right)$ such that every properly edge-colored graph of order $f\left(\delta \right)$ contains a rainbow matching of size $\delta$, which currently has the best bound of $f\left(\delta \right)\le 3.5\delta +2$ by Lo. Babu, Chandran and Vaidyanathan investigated Wang’s question under a stronger color condition. A strongly edge-colored graph is a properly edge-colored graph in which every monochromatic subgraph is an induced matching. Wang, Yan and Yu proved that every strongly edge-colored graph of order at least $2\delta +2$ has a rainbow matching of size $\delta$. In this note, we extend this result to graphs of order at least $2\delta +1$.