We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Remark on Rainbow 6-Cycles in Hypercubes.
- Authors
Hao, Chen; Yang, Weihua
- Abstract
We call an edge-coloring of a graph G a rainbow coloring if the edges of G are colored with distinct colors. For every even positive integer k≥4, let f(n,k) denote the minimum number of colors required to color the edges of the n-dimensional cube Qn, so that every copy of Ck is rainbow. Faudree et al. [6] proved that f(n,4)=n for n=4 or n>5. Mubayi et al. [8] showed that n≤f(n,6)<n1+o(1). In this note, we show that f(n,6)≥2n−1. Moreover, we obtain the number of 6-cycles of Qn.
- Subjects
GRAPH theory; INTEGERS; HYPERCUBES; MATHEMATICS; PRIME numbers
- Publication
Parallel Processing Letters, 2018, Vol 28, Issue 2, pN.PAG
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S012962641850007X