Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite

Xiaoli Yuan, Yuejian Peng

Erdős and Simonovits asked the following question: For an integer $r\ge 2$ and a family of non-bipartite graphs $\mathcal{H}$, determine the infimum of $\alpha$ such that any $\mathcal…