  We say a red/blue edge-coloring of the $n$-dimensional cube graph, $Q_n$, is
antipodal if all pairs of antipodal edges have different colors. Norine
conjectured that in such a coloring there must exist a pair of antipodal
vertices connected by a monochromatic path. Previous work has proven this
conjecture for $n\le 6$. Using SAT solvers we verify that the conjecture holds
for $n = 7$.
