Cycles avoiding a color in colorful graphs (Q2800592)

The paper provides an application of classical results of Ramsey theory to an edge colouring of graphs. A cycle is called \(c\)-edge coloured if its edges are coloured with at most \(c\) colours. In the paper it is proved that for every \(k\geq 3\) the \(k\)-coloured complete graph on \(n\geq 6\) vertices contains \((k-1)\)-edge coloured cycles of all lengths between 3 and at least \((\frac{2k-2}{2k-1}-\frac{2k-4}{\sqrt{n}})n\). It generalises the result of \textit{R. J. Faudree} et al. [ Discrete Math. 309, No. 19, 5891--5893 (2009; Zbl 1189.05081)].