Gallai-Ramsey number of an 8-cycle. Issue 3 (1st September 2020)

• Record Type: Journal Article
• Authors: Gregory, Jonathan; Magnant, Colton; Magnant, Zhuojun
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 17:Issue 3(2020)
• Page Start: 744
• Page End: 748
• Publication Date: 2020-09-01
• Subjects: Gallai-Ramsey; rainbow triangle; 8-cycle
• DOI: 10.1016/j.akcej.2019.09.004
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: Given graphs G and H and a positive integer k, the Gallai-Ramsey number g r k ( 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 = K 3, 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 = C 8 for all k .