报告人： 崔庆副教授

报告时间：2021年11月28日19:00--21:30

腾讯会议ID：168 758 254

报告主题：Tight gaps in the cycle spectrum of 3-connected planar graphs

报告摘要：

Merker recently proved that, for any positive integer k, every 3-connected cubic planar graph of circumference at least k has a cycle whose length is in [k,2k+9]. We improve Merker’s result to [k,2k+3] and construct an infinite family of 3-connected cubic planar graphs showing that this is best possible. We also prove that the same result holds for all 3-connected planar graphs of circumference at least k, confirming a conjecture of Merker. Joint work with On-Hei Solomon Lo.

报告人简介：

崔庆，南开大学博士，美国佐治亚州立大学访问学者，现为南京航空航天大学副教授、硕士生导师。主要研究方向为结构图论，主持国家自然科学基金项目2项，在J. Combin. Theory Ser. B、J. Graph Theory、SIAM J. Discrete Math.、European J. Combin.等期刊发表论文20余篇。