A rainbow matching in an edge-colored graph is a which no two edges have the same color. The color degree of vertex v number distinct colors on incident to v. Kritschgau [Electron. J. Combin. 27(3), 2020] studied existence matchings G with average at least 2k, and proved some sufficient conditions for marching size k G. include that $$|V(G)|\ge 12k^2+4k$$ , or properly 8k$$ . In this paper, we ...