报告题目：Rainbow matchings in strongly edge-colored graphs
报告简介：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.
报告地点：腾讯会议，ID：706 683 803