Randall Stading

Learn More
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 Q n , so that the edges of every copy of the k-cycle C k 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)
  • 1