2018/08/28 by Zhao Wang, Yaping Mao, Wang, Zhao +7
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1808.09245
openalex publication_date 2018/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given two graphs G and H and a positive integer k, the k-color Gallai-Ramsey number, denoted by grk(G : H), is the minimum integer N such that for all n ≥ N, every k-coloring of the edges of Kn contains either a rainbow copy of G or a monochromatic copy of H. We prove that grk (K3 : C2ℓ + 1) = ℓ ⋅ 2k + 1 for all k ≥ 1 and ℓ ≥ 3.