Graphs of odd girth 7 with large degree

We show that every graph with minimum degree δ > 4 n / 17 and no odd cycles of length 3 or 5 is homomorphic with the Möbius ladder with 6 rungs and include the extremal graph characterization in the case of equality. The key tools used in our observations are simple characteristics of maximal odd girth 7 graphs.