- Tytuł:
- Anti-Ramsey numbers for disjoint copies of graphs
- Autorzy:
-
Gorgol, I.
Gorlich, A. - Powiązania:
- https://bibliotekanauki.pl/articles/255048.pdf
- Data publikacji:
- 2017
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
anti-Ramsey number
rainbow number
disjoint copies - Opis:
- 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 Kn with no rainbow copy of H. Anti-Ramsey numbers were introduced by Erdos, 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.
- Źródło:
-
Opuscula Mathematica; 2017, 37, 4; 567-575
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł