##
###
On lengths of rainbow cycles
[article]

Boris Alexeev

2006
*
arXiv
*
pre-print

We settle a question posed by Ball, Pultr, and Vojtěchovský by showing that if such a coloring does not contain a *rainbow* *cycle* of length n, where n is *odd*, then it also does not contain a *rainbow* *cycle* ...
We prove several results regarding edge-colored complete graphs and *rainbow* *cycles*, *cycles* with no color appearing on more than one edge. ...
First, we must show that there exist *rainbow* *cycles* of all *odd* lengths. But this is easy! Consider the *cycle* (1, 2, 3, . . . , k) for k *odd*. ...

arXiv:math/0507456v4
fatcat:xyekbepy6repxmr6tadvvapj5e