The 3-Color 2-Chromatic Gallai-Ramsey Number for Complete Graphs

arXiv:2610.41971 · math.CO · Submitted 2026-10-30 · Read on arXiv

math.CO

Submitted: 2026-10-30

Updated: 2026-10-30

Comments: 25 pages, 4 figures

License: http://creativecommons.org/licenses/by/4.0/

The gist: For 1 at most i at most j at most k, let gr 3 2(K i, K j, K k) be the least n in N such that every rainbow triangle-free 3-coloring of K n (using red, blue, and green) contains a red/blue K i…

Abstract

For 1 at most i at most j at most k, let gr 3 2(K i, K j, K k) be the least n in N such that every rainbow triangle-free 3-coloring of K n (using red, blue, and green) contains a red/blue K i, a red/green K j, or a blue/green K k. In this paper, we completely evaluate gr 3 2(K i, K j, K k) for all values of i, j, and k in which r(K i,K j) is known.

Related papers