Smallest odd cycle forced by planar two-colorings

Determine the smallest integer $\ell$ with $2\leq \ell\leq 13$ such that every 2-coloring of the Euclidean plane contains a monochromatic unit-copy of $C_{2\ell+1}$, and determine whether $\ell=2$.

Background

The paper proves that sufficiently long odd cycles are forced in planar 2-colorings and gives the explicit bound 13\ell\geq 13, while noting that the triangle is avoidable and the case of C_5 is unresolved.

References

What is the smallest integer $\ell$, $2\le \ell\le 13$ such that $2 \xrightarrow{2} C_{2\ell+1}$? Is $\ell=2$?

Ramsey problems for graphs in Euclidean spaces and Cartesian powers  (2512.15516 - Axenovich et al., 17 Dec 2025) in Question Q_odd, Section 6.1 (Planar case)