On the structure of dense graphs with given odd girth

Xingyan Lu, Shipeng Wang

A classical theorem of Andrásfai, Erdős, and Sós states that every $n$-vertex graph $G$ with odd girth at least $2k+1$ and minimum degree $\hat{I}´(G)>\frac{2n}{2k+1}$ is bipartite (i…