For positive integers k and d such that 4≤k<d and k 5, we determine the maximum number of rainbow colored copies of C4 in a k-edge-coloring of the d-dimensional hypercube Qd. Interestingly, the k-edge-colorings of Qd yielding the maximum number of rainbow copies of C4 also have the property that every copy of C4 which is not rainbow is monochromatic.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics