Title：Rainbow cycles in edge-colored graphs

Abstract：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.

Speaker：Jie Hu，University Paris-Sud，mainly works on extremal graph theory and questions on colored graphs. Her results are mainly published on Discrete Mathematics，Discrete Applied Mathematics，Applied Mathematics and Computation etc..

Date：2:00pm-5:00pm 2021-5-13日（Thursday）.

Tencent Meeting ID： 832 786 786

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.