一、讲座主题

Anti-Ramsey Problems for Cycles

二、时间

9月24日（周二）17:00

三、地点

中心校区知新楼B座924报告厅

四、主讲人

陆玫

五、主讲人简介

陆玫，清华大学数学科学系教授，博士生导师，主要从事运筹学、图论与组合优化方面的研究，发表SCI检索学术论文70余篇。现任清华大学数学科学系计算数学与运筹学研究所所长。

六、摘要

We call a subgraph of an edge-colored graph rainbow, if all of its edges have different colors. A rainbow copy of a graph H in an edge-colored graph G is a subgraph of G isomorphic to H such that the coloring restricted to this subgraph is a rainbow coloring. Given two graphs G and H, let Ar(G, H) denote the maximum number of colors in a coloring of the edges of G that has no rainbow copy of H. When G is complete graph, Ar(G, H) is called the anti-Ramsey number. Anti-Ramsey number was introduced by Erdos, Simonovits and Sos in the 1970s. Afterwards some other graphs were used as host graphs. In this talk, we will present some results on Anti-Ramsey number for cycles when the host graph G is wheel, Cartesian product graph and cyclic Cayley graph, respectively.

七、邀请人

颜谨 数学学院教授

八、主办

山东大学数学学院