题目：On Gallai Ramsey Numbers of Cycles

报告人：陈耀俊  教授（南京大学）

时间：2019年6月1日（周六）上午 9：00-10：00

地点：管理科研楼1318

摘要：A Gallai coloring of a complete graph is an edge-coloring such that no trianglehas all its edges colored differently. A Gallaik-coloring is a Gallai coloring thatuses k colors. Given a graph H and an integer k ≥ 1, the Gallai-Ramsey numberGRk(H) of H is the least positive integer N such that every Gallaik-coloring of thecomplete 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).