Tight gaps in the cycle spectrum of 3-connected planar graphs

地   点：  腾讯会议 APP()

报告人：  崔庆

单   位：  南京航空航天大学

邀请人：  汪彦

备   注：  会议主题：SJTU Seminar - Qing Cui 会议时间：2022/07/08 13:45-15:15 (GMT+08:00) 中国标准时间 - 北京 点击链接入会，或添加至会议列表： https://meeting.tencent.com/dm/iCXHk4cau398 #腾讯会议：154-879-627 #密码：220708 手机一键拨号入会 +8675536550000,,154879627# (中国大陆) +85230018898,,,2,154879627# (中国香港) 根据您的位置拨号 +8675536550000 (中国大陆) +85230018898 (中国香港) 复制该信息，打开手机腾讯会议即可参与

报告摘要：  

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.