PreprintCC BY 4.0arXiv
Generalized short monochromatic odd cycles
Abstract
Answering a question of Noga Alon, we generalize a result of Janzer and Yip to show that every k-edge-coloring of Krk+1 contains a monochromatic subgraph with chromatic number at least r+1 and diameter O(k3/2rk/2log r).
Related
- The Beilinson--Bloch heights of generalized Ceresa cycles
- Generalized Chromatic Polynomials of Cycles and uni-cyclic Graphs
- Extremal hypergraphs without generalized 4-cycles
- Generalized Turán problems for shorter even cycles
- Limit Cycles in a Discontinuous Generalized Liénard Systems with Bivariate Perturbation
BibTeX
@misc{luo2026generalized,
title = {{Generalized short monochromatic odd cycles}},
author = {Sammy Luo and Zixuan Xu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.17773},
eprint = {2609.17773},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.17773},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Generalized short monochromatic odd cycles
AU - Sammy Luo
AU - Zixuan Xu
PY - 2026
DA - 2026/09/15
PB - arXiv
DO - 10.48550/arxiv.2609.17773
UR - https://arxiv.org/abs/2609.17773
AB - Answering a question of Noga Alon, we generalize a result of Janzer and Yip to show that every k-edge-coloring of K_r^k+1 contains a monochromatic subgraph with chromatic number at least r+1 and diameter O(k^3/2r^k/2log r).
ER -