Anti-Ramsey numbers for matchings in regular bipartite graphs

Let 𝒢 be a family of graphs. The anti-Ramsey number AR(G,𝒢) for 𝒢 in the graph G is the maximum number of colors in an edge coloring of G that does not have any rainbow copy of any graph in 𝒢. In this paper, we consider the anti-Ramsey number for matchings in regular bipartite graphs and determine its value under several conditions.