Matchings in Hypercubes Extend to Long Cycles

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1,\dots ,n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional hypercube $Q_n$ can be extended into a Hamilton cycle. We prove that matchings of $Q_n$ containing edges spanning at most $d=5$ directions can be extended into a Hamilton cycle. We also characterize when these matchings of most $d=5$ directions can be extended into a Hamilton path between two prescribed vertices. Our proofs work for arbitrary $d$ and $n$ where $d\le n$ assuming some extension properties hold in $Q_d$ which we verified by a computer for $d=5$.