报告题目：On the Anti-Ramsey Number of Linear Forests

报告人：Ali Ghalavand，南开大学

报告时间：2025年11月12日（周三）10:30

报告地点：20-308

报告摘要：An edge-coloring of a graph G involves assigning a color to each edge in the edge set E(G). A graph G is considered rainbow if all of its edges have different colors. For a positive integer n, the anti-Ramsey number of a graph G, denoted as AR(n, G), is defined as the maximum number of colors that can be used in an edge-coloring of the complete graph Kn without containing a rainbow copy of G. This concept was introduced by Erd˝os et al. in 1975. The anti-Ramsey number for linear forests has been extensively studied. In this talk, we will discuss both previous results and open problems in this area.

报告人简介：Ali Ghalavand，南开大学组合数学中心博士后、助理研究员。2021年6月毕业于伊朗卡尚大学数学（图论）专业，获博士学位。主要从事图论及其应用的研究。在《Discrete Appl. Math.》、《Graphs Combin.》、《J. Appl. Math. Comput.》等重要学术期刊上发表论文40余篇。

邀请人：离散数学研究所