Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
Abstract
Given a graph H and an integer k1, the Gallai-Ramsey number GRk(H) is defined to be the minimum integer n such that every k-edge coloring of Kn 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.