Graph Theory about odd cycles
Source: 239 MO 2021 (8-9).3
May 2, 2021
combinatorics
Problem Statement
Given is a simple graph with vertices, such that it is not bipartite and each vertex has degree at least . Find the smallest , such that each odd cycle has length at most .