arXiv:2505.09809 Abstract | arXiv Analytics

arXiv:2505.09809 [math.CO]Abstract References Reviews Resources

On Alternating 6-Cycles in Edge-Coloured Graphs

Published 2025-05-14Version 1

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\"undgen and Staden.

Comments: 19 pages, 2 figures

Categories: math.CO, cs.DM

Subjects: 05C35

Keywords: edge-coloured graphs, alternating, first open case, short note, flag algebras

Related articles: Most relevant | Search more

arXiv:1201.0630 [math.CO] (Published 2012-01-03)

Sets with no solutions to $x+y=3z$

Mate Matolcsi, Imre Z. Ruzsa

arXiv:1302.2100 [math.CO] (Published 2013-02-08)

Short note on the convolution of binomial coefficients

Rui Duarte, António Guedes de Oliveira

arXiv:1607.04741 [math.CO] (Published 2016-07-16)