Problem

Source: 239 MO 2021 (8-9).3

Tags: combinatorics



Given is a simple graph with $239$ vertices, such that it is not bipartite and each vertex has degree at least $3$. Find the smallest $k$, such that each odd cycle has length at most $k$.