学术报告

报告题目：Cycle Traversability of Graphs

报告人: 叶东 副教授 （美国中田纳西州立大学）

报告时间: 2020年8月23日10:00

报告地点: 腾讯会议898 645 687

内容摘要：A graph G is k-cyclable if for any give k vertices, G has a cycle through these given k vertices. A graph is Hamiltonian if it is n-cyclable where n is the number of vertices of G. A classic result of Dirac says that every k-connected graph is k-cyclable. The result of Dirac is sharp in the sense that there are k-connected graphs which are not (k+1)-cyclable. As a generalization of the concept k-cyclability, a graph G is (k,l)-cyclable if for any give k+l vertices, the graph G has a cycle through any k vertices among these k+l vertices but avoiding the rest l vertices. A k-connected graph is (x,y)-cyclable if x+y=k and x>1.  In this talk, we will focus on cyclabilities of claw-free graphs and polyhedral maps and some open problems in this area. This talk is based on joint work with Gyori, Plummer and Zha.

报告人简介: 叶东，中田纳西州立大学数学科学系和计算科学中心副教授、博士生导师。2012年于西弗吉尼亚大学数学系获博士学位，师从张存铨教授。主要在图论、组合以及相关领域从事研究工作，和合作者一起解决了图的逆、图的嵌入、以及匹配方面的多个公开问题和猜想。目前在Combinatorica，Journal of Combinatorial Theory Series B，SIAM Journal on Discrete Mathematics等刊物上发表SCI论文40余篇，并且担任国际学术期刊《Theory and Applications of Graphs》执行编委，以及《Journal of Combinatoric，Information & System Sciences》编委。