报告题目：Anti-Ramsey number for graphs with small components

报告人：金泽民教授，浙江师范大学

报告时间：2023年5月12日09:30—11:30

报告地点：腾讯会议ID 644183656

主办单位：理学院

报告人简介：金泽民，浙江师范大学教授，入选浙江省高校中青年学科带头人。2005年毕业于南开大学组合数学中心。主要研究边染色图的结构性质及相关参数，包括图的anti-Ramsey数等，在包括European J. Combin.,Discrete Math.等国际期刊发表论文40余篇，主持国家自然科学基金项目2项，浙江省基金2项。

报告摘要：

Given an edge-coloring of a graph G, G is said to be rainbow if any two edges of G receive different colors. The anti-Ramsey number AR(G, H) is defined to be the maximum integer k such that there exists a k-edge-coloring of G avoiding rainbow copies of H. The anti-Ramsey problem has been well studied for several graph classes.The researchers focused on the anti-Ramsey problem for some special graph classes,including clique, cycle, path, matching etc during the early decades. Gilboa and Roditty (S. Gilboa, Y. Roditty, Anti-Ramsey numbers of graphs with small connected components, Graphs Combin. 32(2)(2016), 649-662) first considered the anti-Ramsey number of graphs with small components, especially graphs including a matching ascomponents. In this talk, we present some results on this topic and report our recent results on the value of anti-Ramsey number of graphs with a matching as components.