A stability result for $C_{2k+1}$-free graphs

Sijie Ren, Jian Wang, Shipeng Wang +1

A graph $G$ is called $C_{2k+1}$-free if it does not contain any cycle of length $2k+1$. In 1981, Haggkvist, Faudree and Schelp showed that every $n$-vertex triangle-free graph wit…