Year: 2026
Type: article
Abstract: It is easy to see that every [Formula: see text]-edge-coloring of the complete graph on [Formula: see text] vertices must contain a monochromatic odd cycle. A natural question raised by Erdős and Graham in 1973 asks for the smallest [Formula: see text] such that every [Formula: see text]-edge-coloring of [Formula: see text] must contain a monochromatic odd cycle of length at most [Formula: see text]. In here, we show that [Formula: see text] giving the first nontrivial upper bound on [Formula: see text].
DOI: 10.1137/25m1807575
Authors: António Girão, Zach Hunter
Institutions: University of Oxford, ETH Zurich
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4405269660
