学术报告

报告题目：Anti-Ramseyproblems in complete bipartite graphs

报告人：陆玫  教授

报告时间：5月10日上午8：30 - 9：30

报告地点：数统院307

                                          数学与统计学院

                                          2019.5.7

报告摘要：A subgraph H of an edge-colored graph Gis rainbow if all of its edges have different colors. The anti-Ramsey number isthe maximum number of colors in an edge-coloring of G with no rainbow copy ofH. Originally a complete graph was considered as $G$. In this talk, we considera complete bipartite graph as the host graph and discuss some results for thegraph H being hamiltonian cycle, perfectmatching and spanning tree, respectively.

报告人简介：陆玫，1993年7月在中国科学院数学与系统科学研究院获博士学位，现为清华大学数学科学系教授，博士生导师，主要从事运筹学、图论与组合优化方面的研究,发表SCI检索学术论文70余篇。现任清华大学数学科学系计算数学与运筹学研究所所长。