Matchings extend to Hamiltonian cycles in hypercubes

Medium ★★ Graph Theory » Basic Graph Theory » Matchings accessible to undergrads

Status partial high confidence

The Ruskey–Savage conjecture that every matching of $Q_d$ ($d \geq 2$) extends to a Hamiltonian cycle remains open. Substantial progress has been made: Fink and Mütze (2025) proved that every matching of $Q_d$ can be extended to a cycle visiting at least $2/3$ of all vertices; Fink and Hotmar (2025) proved the full conjecture for matchings whose edges span at most 5 directions, which in particular settles the $d = 5$ case completely.

Cited literature (4)

Reviewer notes. Fink also proved in 2019 (Combinatorica 39:77–84) that every matching in a hypercube extends into a 2-factor (spanning union of cycles), which is weaker than a single Hamiltonian cycle but provides structural insight. The Q_5 case follows from the 5-directions result of Fink–Hotmar because every matching in Q_5 uses edges in at most 5 directions. The conjecture for general Q_d (d ≥ 6) with matchings spanning more than 5 directions remains open.

Auto-reviewed 2026-05-08 with claude-sonnet-4-6 (worker 05) (web search enabled).

Question. Does every matching of hypercube extend to a Hamiltonian cycle ?
Keywords: Hamiltonian cycle · hypercube · matching

Discussion

This question is due to Ruskey and Savage and appears in [RS] (page 19, question 3). The answer is positive for $ d $ -cube if $ d \le 4 $ . Fink [F] proved Kreweras' conjecture [K] which asserts that every perfect matching of hypercube extends to a Hamiltonian cycle.

Bibliography

  • [RS] F. Ruskey and C. D. Savage, SIAM Journal on Discrete Mathematics 6, No.1 (1993) 152-166. download download
  • [F] J. Fink. Perfect matchings extend to Hamilton cycles in hypercubes. J. Comb. Theory, Ser. B, 97(6):1074-1076, 2007. download download
  • [K] G. Kreweras, Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Combin. Appl. 16 (1996), 87--91.