On Gallai Ramsey Numbers of Cycles


Topic:On Gallai Ramsey Numbers of Cycles

Speaker: Professor Chen Yaojun

Event date: 1/16/2019

Event time: 15:30 p.m.

Venue: Lecture Hall 204, Building 9

Sponsor: School of Mathematics and Statistics, Institute of Science and Technology

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 Gallaik-coloring of the complete graph KN contains a monochromatic copy of H. Let Cn denote a cycleon n vertices.In this talk, we will report our new results on the Gallai-Ramsey numbers GRk(C2n) and GRk(C2n+1).