Answers are grounded in this paper and cite their sources.
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].
No takes yet. Share an insight, caveat, or question.
Girão et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: