Title: Some results on Gallai-Ramsey numbers of Graphs

Keynote Speaker:Bing Wei

Abstract:

A Gallai coloring of a complete graph $K_n$ with $n$ vertices is an edge-coloring such that no triangle has all its edges colored differently. For any integer $k\ge 1$, a Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. Given a graph $H$ and the Gallai-Ramsey number $GR_k(H)$ of $H$ is the least positive integer $N$ such that every Gallai $k$-coloring of the complete graph $K_N$ contains a monochromatic copy of $H$. In general, $GR_k(H)$ is very hard to determine even for $H$ with small number of vertices as $GR_2(K_5)$ is still unknown. In this talk, we will introduce some basic tools and methods for investigating the Gallai-Ramsey numbers for graphs and present some recent results we obtained for $GR_k(H)$ when $H$ has $5$ vertices. Further research problems will also be proposed.

Speaker Introduction:

Bing Wei，professor of University of Mississippi

Inviter:

Wang Guanghui,professor of School of Mathematics

Time:

9:30, June4 (Thursday)

Location:

Hall 924, Block B, Zhixin Building, Central Campus

Hosted by: School of Mathematics, Shandong University