论文标题
加莱 - 拉姆西的星空联盟号码
Gallai-Ramsey number for the union of stars
论文作者
论文摘要
给定图形$ g $和一个正整数$ k $，将\ emph {gallai-ramsey number}定义为最小数量的顶点$ n $，以使完整图$ k_n $的任何$ k $ - edge颜色都包含rainbow（所有不同的彩色）triangle或$ g $的单色副本。在本文中，我们在许多情况下，在许多情况下以及在其他情况下的界限中获得了加莱 - 拉姆西数的确切值。这项工作代表了一类断开的图形，被视为所需的单色子图。
Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of the complete graph $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. 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.
