On Alternating 6-Cycles in Edge-Coloured Graphs
The Electronic Journal of Combinatorics · 07.08.2026 · 33 (3)
DOI: 10.37236/14204 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 07.08.2026. Verfasst von Hao Chen und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In this short note, we use flag algebras to prove that the number of colour alternating $6$-cycles in a red/blue colouring of a large clique is asymptotically maximized by a uniformly random colouring. This settles the first open case of a problem of Basit, Granet, Horsley, Kündgen and Staden.
Zitieren
APA
Chen, H., & Noel, J. (2026). On Alternating 6-Cycles in Edge-Coloured Graphs. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/14204
Vancouver
Chen H, Noel J. On Alternating 6-Cycles in Edge-Coloured Graphs. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/14204
BibTeX
@article{Chen2026,
author = {Chen, Hao and Noel, Jonathan},
title = {On Alternating 6-Cycles in Edge-Coloured Graphs},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {3},
doi = {10.37236/14204}
}
EUVIMED