Abstract

Given a graph GG and a positive integer kk, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices nn such that any kk-edge coloring of the complete graph KnK_n contains either a rainbow (all different colored) triangle or a monochromatic copy of GG. In this paper, we obtain the exact value of the Gallai-Ramsey numbers for the union of two stars in many cases and bounds in other cases. This work represents the first class of disconnected graphs to be considered as the desired monochromatic subgraph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.