Anti-Ramsey Numbers for Graphs with Independent Cycles
Anti-Ramsey Numbers for Graphs with Independent Cycles
复制标题
DOI：
10.37236/174
复制
发表时间：
2009-07
期刊：
影响因子：
--
通讯作者：
Zemin Jin;Xueliang Li
中科院分区：
文献类型：
--
作者：
Zemin Jin;Xueliang Li
如果边缘上的所有颜色都不相同，则称为彩虹。设${\cal G}$是一个图族。由Erdős等人引入的${\cal G}$的反拉姆齐数$AR(n,{\cal G})$是${\cal G}$中没有任何图的彩虹副本的$K_n$的边着色中的最大颜色数。本文确定了反拉姆齐数$AR(n,\Omega_2)$，其中$\Omega_2$表示包含两个独立循环的图族。
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let ${\cal G}$ be a family of graphs. The anti-Ramsey number $AR(n,{\cal G})$ for ${\cal G}$, introduced by Erdős et al., is the maximum number of colors in an edge coloring of $K_n$ that has no rainbow copy of any graph in ${\cal G}$. In this paper, we determine the anti-Ramsey number $AR(n,\Omega_2)$, where $\Omega_2$ denotes the family of graphs that contain two independent cycles.