Speaker
Jun Gao
(ECOPRO in IBS)
Description
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)
Co-authors
Dr
Qingyi Huo
Prof.
Jie Ma
Prof.
Chun-Hung Liu
