报告主题：圈的反拉姆齐问题
报告人：陆玫教授 （清华大学）
报告时间：2020年12月23日（周三） 14:00
会议形式：腾讯会议
会 议 ID：880 271 601
邀请人：康丽英
报告摘要：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.
欢迎教师、学生参加！