题目： Study on the anti-Ramsey numbers of graphs

主讲人：金泽民 教授

时间：2025年12月16日（星期二）15:00                

地点：#腾讯会议：370-879-203

主办单位：理学院

主讲人简介：

金泽民，浙江师范大学数学科学学院教授，博士生导师，浙江省高校中青年学科带头人，研究方向图论和组合优化，主要研究图的结构、极值图论方面的问题，尤其在图的anti-Ramsey数的研究方面取得一系列的成果，在包括Euop J Comb, J Graph Theory, Discrete Math, Dsicrete Appl Math等国际期刊发表论文50余篇，主持国家自然科学基金项目3项，主持浙江省自然科学基金2项。

摘要：

Let H be a subgraph of G. The anti-Ramsey number of H in G is defined to be the maximum number of colors in an edge-coloring of G, which does not contain rainbow H. The anti-Ramsey number was introduced in 1975 by Erdos et al. and was shown to be close related to the Turan number of graphs. So far the anti-Ramsey numbers of several graphs in complete graphs, including cliques, paths, cycles, matchings etc, have been determined. During recent years, an interesting problem was to study the problem for graphs consisting of small components, in particular, the union of a graph and a matching. In this talk, we will present some progress on this topic.