English Version

热点链接

资讯在线
  图书馆
网上办公
教务系统
书记校长信箱

学术活动

18新利体育学术活动

Anti-Ramsey Problems for Cycles

主 讲 人 :陆玫    教授

活动时间:04月14日16时40分    

地      点 :理科群D203;Tencent会议ID:865 899 218;密码:691418

讲座内容:

Wecall a subgraph of an edge-colored graph rainbow, if all of its edges havedifferent colors. A rainbow copy of a graph H in an edge-colored graph G is asubgraph of G isomorphic to H such that the coloring restricted to thissubgraph is a rainbow coloring. Given two graphs G and H, let Ar(G, H) denotethe maximum number of colors in a coloring of the edges of G that has norainbow copy of H. When G is complete graph, Ar(G, H) is called the anti-Ramseynumber. Anti-Ramsey number was introduced by Erdos, Simonovits and Sos in the1970s. Afterwards some other graphs were used as host graphs. In this talk, wewill present some results on Anti-Ramsey number for cycles when the host graphG is wheel, Cartesian product graph and cyclic Cayley graph, respectively.

主讲人先容:

陆玫,清华大学数学科学系教授,博士生导师。1993年在中国科学院数学与系统科学研究院获博士学位,主要从事运筹学、图论与组合优化方面的研究。论文发表在《Journal of Combinatorial Theory, Series B》、《Journalof Graph Theory》、《Journal of Combinatorial Optimization》等国际权威学术期刊。现任清华大学数学科学系计算数学与运筹学研究所所长,中国运筹学会图论组合分会副理事长,中国工业与应用数学学会图论组合及应用专业委员会秘书长,中国组合数学与图论学会理事。

发布时间:2021-04-13 10:23:48

版权所有18新利体育    冀ICP备18011017号-3  

冀公网安备 13010802000630号


地址:河北省石家庄市南二环东路20号 邮编:050024 
XML 地图 | Sitemap 地图