论文标题
Gallai-Ramsey编号，用于五个音阶的图形四个音阶
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
论文作者
论文摘要
给定图形$ h $和一个整数$ k \ ge1 $，Gallai-ramsey编号$ gr_k（h）$被定义为最小整数$ n $，这样每种$ k $ g $ k_n $的颜色都包含彩虹（所有不同的彩色）三角形或单色副本，或者单色of $ h $。在本文中，我们确定了连接图的Gallai-Ramsey编号，其中五个是色数四的顶点。
Given a graph $H$ and an integer $k\ge1$, the Gallai-Ramsey number $GR_k(H)$ is defined to be the minimum integer $n$ such that every $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $H$. In this paper, we determine the Gallai-Ramsey numbers for connected graphs with five vertices of chromatic number four.
