设为主页 加入收藏 English

信息速递News

首页 / 信息速递 / 学术动态 / 正文

扬州大学数学科学学院学术报告2021-54

报告题目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.


报告人:李振,贵州大学博士,主要从事图论研究。


报告时间:2021年9月3日(星期五)下午 19:30-22:00.

报告地点:腾讯会议,ID:706 683 803


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

欢迎广大师生参加!


电话:0514-87975402
邮编:225002
地址:江苏省扬州市四望亭路180号
版权所有:扬州大学数学科学学院

关注官方微信