Gray codes extending quadratic matchings |
| |
Authors: | Tomá? Dvo?ák Ji?í Fink |
| |
Institution: | Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic |
| |
Abstract: | Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way. |
| |
Keywords: | Gray code Hamilton cycle hypercube matching Ruskey and Savage problem |
|
|