Monochromatic Odd Cycles in Edge-Colored Complete Graphs

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].

Authors

Institutions

Publication Details

Journal
SIAM Journal on Discrete Mathematics
Published
2026-11-18
DOI
https://doi.org/10.1137/25m1807575
Citations
6
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
7.32
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Monochromatic Odd Cycles in Edge-Colored Complete Graphs

Zach Hunter, António Girão
6 citations
SIAM Journal on Discrete Mathematics
Limits and Structures in Graph Theory
7.32
article

Monochromatic Odd Cycles in Edge-Colored Complete Graphs

Zach Hunter, António Girão
article en
6 citations

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].

SIAM Journal on Discrete MathematicsVol. 40(4)
ETH Zurich (CH), University of Oxford (GB)
Openalex Percentile: Top 3%
Limits and Structures in Graph Theory
7.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon