报告题目：Cycle lengths in 3-connected planar graphs
报告人：Solomon Lo,日本横滨国立大学
报告时间：2023年4月26日10:00-11:00
报告地点：21-427
摘要：It is well known that Euler's formula implies every 3-connected planar graph has a cycle of length 3, 4 or 5. Motivated by this fact, it is shown that given any integer k at least 5, every 3-connected planar graph that contains some cycle of length at least k must have a cycle of length between k and 2k + 3; and the number 2k + 3 is tight. In this talk we may also review related problems and results concerning other planar graph classes.
邀请人：朱绪鼎