TY  - JOUR
ID  - Gorgol2017
LB  - Gorgol2017
AU  - Gorgol, Izolda
AU  - Görlich, Agnieszka
TI  - Anti-Ramsey numbers for disjoint copies of graphs
ST  - Anti-Ramsey numbers for disjoint copies of graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2017
VL  - 37
IS  - 4
SP  - 567
EP  - 575
DO  - http://dx.doi.org/10.7494/OpMath.2017.37.4.567
UR  - http://dx.doi.org/10.7494/OpMath.2017.37.4.567
AB  - 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.
KW  - anti-Ramsey number
KW  - rainbow number
KW  - disjoint copies
SN  - 1232-9274
ER  -