Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: anti-Ramsey number

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Rainbow numbers for small stars with one edge added

100%

Gorgol I., Łazuka E.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 4

555-562

A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n,H) is the maximum number of colors in an edge-coloring of Kₙ with no rainbow copy of H. The rainbow number rb(n,H) is the minimum number of colors such that any edge-coloring of Kₙ with rb(n,H) number of colors contains a rainbow copy of H. Certainly rb(n,H) = f(n,H) + 1. Anti-Ramsey numbers were introduced by Erdös et al. [5] and studied in numerous papers. We show that $rb(n,K_{1,4} + e) = n + 2$ in all nontrivial cases.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Gorgol I.

1 Łazuka E.

1 2010

Wyniki wyszukiwania

Rainbow numbers for small stars with one edge added