Title: On Gallai Ramsey Numbers of Cycles

Keynote Speaker: Chen Yaojun

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 Cn denote a cycle on n vertices. In this talk, we will report our new results on the Gallai-Ramsey numbers GRk(C2n) and GRk(C2n+1).

Speaker Introduction: Chen Yaojun, professor and doctoral supervisor of the Department of Mathematics of Nanjing University; council member of the 9th and 10th Operations Research Society of China. In July 2000, he received his Doctor of Science from the Academy of Mathematics and Systems Science, Chinese Academy of Sciences; during July 2000 - June 2002, he was engaged in post-doctoral research in the Department of Mathematics of Nanjing University; during September 2003 - August 2005, he worked on post-doctoral research in the Logistics Department, School of Business, The Hong Kong Polytechnic University; at present, he mainly studies specific subgraph structure, Ramsey number, coding theory, theoretical computer science and interdisciplinary problem of combinatorics and graph theory; in recent years, he has presided over several projects of Natural Science Foundation of China, and published lots of research papers in professional academic journals at home and abroad, of which nearly 50 paper were published in SCI search source journals.

Inviter: Wu Jianliang, professor of School of Mathematics

Time: 17:00, May 16 (Thursday)

Location: Hall 924, Block B, Zhixin Building, Central Campus

Hosted by: School of Mathematics, Shandong University