报告题目：Rainbow cycles in edge-colored graphs

报告简介：Let G be an edge-colored graph of order n. The minimum color degree of G is the largest integer k such that for every vertex v, there are at least k distinct colors on edges incident to v. We say that an edge-colored graph is rainbow if all its edges have different colors. During the past decades, establishing sufficient conditions forcing rainbow cycles has received considerable attention. In this talk, I will introduce minimum color degree conditions for the existence of vertex-disjoint rainbow triangles, and rainbow C_4’s.

报告人： 胡杰，巴黎十一大，研究方向为图论及其应用，主要包括染色图和一般图中的极值问题，已在Discrete Mathematics，Discrete Applied Mathematics，Applied Mathematics and Computation等期刊发表SCI论文数篇。

报告时间：2021年5月13日（星期四）下午 2:00-5:00.

报告地点：腾讯会议，ID： 832 786 786

主办单位：扬州大学数学科学学院

欢迎广大师生参加！