@Article{Gorgol2017,
author = "Gorgol, Izolda and Görlich, Agnieszka",
title = "Anti-Ramsey numbers for disjoint copies of graphs",
journal = "Opuscula Math.",
year = "2017",
volume = "37",
number = "4",
pages = "567--575",
doi = "http://dx.doi.org/10.7494/OpMath.2017.37.4.567",
url = "http://dx.doi.org/10.7494/OpMath.2017.37.4.567",
abstract = "A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph \(G\) and a positive integer \(n\), the anti-Ramsey number \(ar(n,G)\) is the maximum number of colors in an edge-coloring of \(K_n\) with no rainbow copy of \(H\). Anti-Ramsey numbers were introduced by Erdȍs, Simonovits and Sós and studied in numerous papers. Let \(G\) be a graph with anti-Ramsey number \(ar(n,G)\). In this paper we show the lower bound for \(ar(n,pG)\), where \(pG\) denotes \(p\) vertex-disjoint copies of \(G\). Moreover, we prove that in some special cases this bound is sharp.",
keywords = "anti-Ramsey number, rainbow number, disjoint copies",
issn = "1232-9274"
}