Article
Rainbow copies of C4 in edge-colored hypercubes
Discrete Applied Mathematics
Document Type
Article
Disciplines
Publication Version
Accepted Manuscript
Publication Date
9-10-2016
DOI
10.1016/j.dam.2014.10.002
Abstract
For positive integers k and d such that 4 <= k < d and k not equal 5, we determine the maximum number of rainbow colored copies of C-4 in a k-edge-coloring of the d-dimensional hypercube Q(d). Interestingly, the k-edge-colorings of Q(d) yielding the maximum number of rainbow copies of C-4 also have the property that every copy of C-4 which is not rainbow is monochromatic.
Creative Commons License
Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International
Copyright Owner
Elsevier, B.V.
Copyright Date
2016
Language
en
File Format
application/pdf
Citation Information
József Balogh, Michelle Delcourt, Bernard Lidicky and Cory Palmer. "Rainbow copies of C4 in edge-colored hypercubes" Discrete Applied Mathematics Vol. 210 (2016) p. 35 - 37 Available at: http://works.bepress.com/bernard-lidicky/12/
This is a manuscript of an article published as Balogh, József, Michelle Delcourt, Bernard Lidický, and Cory Palmer. "Rainbow copies of C4 in edge-colored hypercubes." Discrete Applied Mathematics 210 (2016): 35-37. doi: 10.1016/j.dam.2014.10.002. Posted with permission.