Abstract

A cube-like graph is a Cayley graph for the elementary abelian group of order 2n2^n. In studies of the chromatic number of cube-like graphs, the kkth power of the nn-dimensional hypercube, QnkQ_n^k, is frequently considered. This coloring problem can be considered in the framework of coding theory, as the graph QnkQ_n^k can be constructed with one vertex for each binary word of length nn and edges between vertices exactly when the Hamming distance between the corresponding words is at most kk. Consequently, a proper coloring of QnkQ_n^k corresponds to a partition of the nn-dimensional binary Hamming space into codes with minimum distance at least k+1k+1. The smallest open case, the chromatic number of Q82Q_8^2, is here settled by finding a 13-coloring. Such 13-colorings with specific symmetries are further classified.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.