A note on Gallai-Ramsey number of even wheels

Abstract

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai k-coloring is a Gallai coloring that uses k colors. Given a graph H and an integer k≥ 1, the Gallai-Ramsey number GRk(H) of H is the least positive integer N such that every Gallai k-coloring of the complete graph KN contains a monochromatic copy of H. Let W2n denote an even wheel on 2n+15 vertices. In this note, we study Gallai-Ramsey number of W2n and completely determine the exact value of GRk(W4) for all k2.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…