Coloring the Cube with Rainbow Cycles


For every even positive integer k > 4 let f(n, k) denote the minimim number of colors required to color the edges of the n-dimensional cube Qn, so that the edges of every copy of the k-cycle Ck receive k distinct colors. Faudree, Gyárfás, Lesniak and Schelp proved that f(n, 4) = n for n = 4 or n > 5. We consider larger k and prove that if k ≡ 0 (mod 4… (More)


Cite this paper

@article{Mubayi2013ColoringTC, title={Coloring the Cube with Rainbow Cycles}, author={Dhruv Mubayi and Randall Stading}, journal={Electr. J. Comb.}, year={2013}, volume={20}, pages={P4} }