Document Type
Lecture
Publication Date
5-1-2018
Abstract
Ramsey theory dates back to the 1930's and computing Ramsey numbers is a notoriously difficult problem in combinatorics. We study Ramsey numbers of graphs in Gallai colorings, where a Gallai coloring is a coloring of the edges of a complete graph such that no triangle has all its edges colored differently. Given an integer k ::::: 1 and "forbidden" graphs H1, ... , Hk, the Gallai-Ramsey number GR(H1, ... , Hk) is the least integer n such that every Gallai coloring of the complete graph Kn using k colors contains a monochromatic copy of Hi in color i for some i E {1, ... , k}. Gallai-Ramsey numbers are more well-behaved, though computing them is far from trivial. In this talk, I will present our recent results on Gallai-Ramsey numbers of cycles and paths. This is joint work with Christian Bosse and Jingmei Zhang.
Relational Format
presentation
Recommended Citation
Song, Zixia, "Multicolor Gallai-Ramsey Numbers of Cycles and Paths" (2018). Combinatorics Seminar. 21.
https://egrove.olemiss.edu/math_combinatorics/21
