Dean's conjecture and cycles modulo k

Yufan Luo, Jie Ma, Ziyuan Zhao

Dean conjectured three decades ago that every graph with minimum degree at least $k\ge 3$ contains a cycle whose length is divisible by $k$. While the conjecture has been verified…