Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 35-37 |
Number of pages | 3 |
Journal | Discrete Applied Mathematics |
Volume | 210 |
DOIs | |
State | Published - Sep 10 2016 |
Keywords
- Edge-coloring
- Hypercube
- Rainbow