Monochromatic Odd Cycles in Edge-Colored Complete Graphs
SIAM Journal on Discrete Mathematics · 31.12.2026 · 40 (4) · 1946-1949
DOI: 10.1137/25m1807575 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 18.11.2026. Verfasst von António Girão und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben.
Abstract (Originalsprache)
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].
Zitieren
APA
Girão, A., & Hunter, Z. (2026). Monochromatic Odd Cycles in Edge-Colored Complete Graphs. SIAM Journal on Discrete Mathematics, 40(4), 1946-1949. https://doi.org/10.1137/25m1807575
Vancouver
Girão A, Hunter Z. Monochromatic Odd Cycles in Edge-Colored Complete Graphs. SIAM Journal on Discrete Mathematics. 2026;40(4):1946-1949. doi:10.1137/25m1807575
BibTeX
@article{Giro2026,
author = {Girão, António and Hunter, Zach},
title = {Monochromatic Odd Cycles in Edge-Colored Complete Graphs},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {4},
pages = {1946--1949},
doi = {10.1137/25m1807575}
}
EUVIMED