学术报告

Multicolor Gallai-Ramsey Numbers of Cycles and Paths

阅读次数:1283

题目:Multicolor Gallai-Ramsey Numbers of Cycles and Paths
报告人:Zi-Xia Song (University of Central Florida)
地点:致远楼103室
时间:2018年7月4日(周三)下午4:00--5:00
摘要: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\ge1$ and ``forbidden" graphs $H_1,  \ldots, H_k$, the Gallai-Ramsey number $GR(H_1, \ldots, H_k)$ is the least integer $n$ such that every Gallai  coloring of the complete graph $K_n$  using  $k$ colors  contains a monochromatic copy of $H_i$ in color $i$ for some $i \in \{1,  \ldots, 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.

欢迎各位参加!

联系我们

    电话:86-21-65981384

    地址:上海市四平路1239号 致远楼

Copyright © 2018  同济大学数学科学学院 版权所有.