Anti-Ramsey numbers for graphs with independent cycles (Q2380240)

Summary: An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let \({\mathcal G}\) be a family of graphs. The anti-Ramsey number \(\text{AR}(n,{\mathcal G})\) for \({\mathcal G}\), introduced by Erdős et al., is the maximum number of colors in an edge coloring of \(K_n\) that has no rainbow copy of any graph in \({\mathcal G}\). In this paper, we determine the anti-Ramsey number \(\text{AR}(n,\Omega_2)\), where \(\Omega_2\) denotes the family of graphs that contain two independent cycles.