Title：Rainbow matchings in strongly edge-colored graphs

Abstract：This report is an overview report on rainbow matching in strongly edge-colored graphs. Erdős and Nesetril first introduced the concept of strong edge-colored and strong chromatic index. After that, the strongly edge-colored graphs have been well studied in the literature. Recently, the results in this area have focused on finding the lower bound of the size of the largest rainbow matching of a strongly edge-colored graph with a given minimum degree.

Speaker：Zhen Li, Ph.D, Guizhou University. His research interests include graph theory.

Date：7:30pm-10:00pm 2021-9-3（Friday）.

Tencent Meeting ID： 706 683 803

Organizer：School of Mathematical Science

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