报告摘要： In 1983, C. Thomassen proved that every（k+3）-connected graph contains a cycle C such that G-V(C) is k-connected. Further, he proved that every (k+1)-connected graph with minimum degree at least g(k) can be partitioned into a 2-connected subgraph and a k-connected subgraph for some function g(k). In this talk, I will show that every (k+1)-connected graph with minimum degree at least 3k/2+2m-3 contains a cycle C of length at least m such that G-V(C) is k-connected, where the minimum degree requirements are almost optimal. Our proof also leads to a polynomial time algorithm to find such a cycle. This is joint work with Lin Tian.
报告人简介：叶东，美国中田纳西州立大学数学科学系、计算和数据科学中心教授、博士生导师。1998年至2005年在兰州大学学习并获得学士和硕士学位，2012年于西弗吉尼亚大学获得博士学位。主要在图论、组合以及相关领域从事研究工作，与合作者一起解决了多个五星体育app开问题和猜想，在Combinatorica, Journal of Combinaotiral Theory Ser B, SIAM Journal on Discrete Mathematics等刊物上发表星空平台app论文50余篇。
报告时间：2026年6月8日 10:00-12:00
报告地点：北衡楼1421
English