September 30, 2022 to October 1, 2022
Asia/Seoul timezone

A unified proof of conjectures on cycle lengths in graphs

Sep 30, 2022, 5:35 PM
Contributed talk Session 2


Jun Gao (ECOPRO in IBS)


We prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain a number of exact and optimal results on cycle lengths in graphs of given minimum degree, connectivity or chromatic number.

This is joint work with Qingyi Huo, Chun-Hung Liu and Jie Ma.

Primary author

Jun Gao (ECOPRO in IBS)


Dr Qingyi Huo Prof. Jie Ma Prof. Chun-Hung Liu

Presentation materials

There are no materials yet.