2019/05/18 by Gregory, Jonathan, Magnant, Colton, Magnant, Zhuojun
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1905.07615
Given graphs G and H and a positive integer k, the Gallai-Ramsey number grk(G : H) is the minimum integer N such that for any integer n ≥ N, every k-edge-coloring of Kn contains either a rainbow copy of G or a monochromatic copy of H. These numbers have recently been studied for the case when G = K3, where still only a few precise numbers are known for all k. In this paper, we extend the known precise Gallai-Ramsey numbers to include H = C8 for all k.