理学院线上学术报告:Anti-Ramsey Problems for Cycles

发布者:综合科发布时间:2020-06-30浏览次数:17

报告题目:Anti-Ramsey Problems for  Cycles

报告人:陆玫(清华大学教授)

报告时间:202076日上午1000

腾讯会议号:617 420 600密码:0706

邀请人:顾冉

  

报告摘要: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.

  

  

报告人简介:陆玫,清华大学数学科学系教授,博士生导师。现任清华大学数学科学系计算数学与运筹学研究所所长,中国运筹学会图论组合分会副理事长,中国工业与应用数学学会图论组合及应用专业委员会秘书长,中国组合数学与图论学会理事。主要从事运筹学、图论与组合优化方面的研究,在国际权威学术期刊发表SCI检索论文70余篇。