A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The chromatic number of the square of the $8$-cube
2017
Mathematics of Computation
A cube-like graph is a Cayley graph for the elementary abelian group of order 2 n . In studies of the chromatic number of cube-like graphs, the kth power of the n-dimensional hypercube, Q k n , is frequently considered. This coloring problem can be considered in the framework of coding theory, as the graph Q k n can be constructed with one vertex for each binary word of length n and edges between vertices exactly when the Hamming distance between the corresponding words is at most k.
doi:10.1090/mcom/3291
fatcat:6afwfvzw2vdmfn2ovdcpvilzta