题目：An edge-colored version of Caccetta-Häggkvist Conjecture

主讲人：丁来浩

摘要：Finding properly colored cycles or rainbow cycles in edge-colored graphs under color degree constraints is an important topic. In this talk, I will introduce our work on this problem. Especially, we will describe a typical structure of any graph without properly colored Ks,t's for any given integers s≥2,t≥2 and generalize some important conjectures about the existence of directed cycles to properly edge colored cycles using this structure.

主讲人简介：丁来浩，华中师范大学讲师。研究方向主要是图论及其应用。

邀请人：王光辉  数学学院教授

时间：2019年3月20日（周三） 10:00

地点：知新楼B座1032报告厅