On Alternating 6-Cycles in Edge-Coloured Graphs
Abstract
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.
Fields of Study & Subjects
graph theory and CDMA systems
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Volume
- 33
- Issue
- 3
- Publication date
- 7 August 2026
- Language
- EN