Abstract
Ruskey and Savage asked the following question: does every matching of a hypercube \(Q_{n}\) for \(n\ge 2\) extend to a Hamiltonian cycle of \(Q_{n}\)? Fink confirmed that the question is true for every perfect matching, thus solved Kreweras’ conjecture. In this paper we prove that every matching of at most \(3n-10\) edges can be extended to a Hamiltonian cycle of \(Q_{n}\) for \(n\ge 4\).
Similar content being viewed by others
References
Caha, R., Koubek, V.: Spanning multi-paths in hypercubes. Discret. Math. 307, 2053–2066 (2007)
Dimitrov, D., Dvořák, T., Gregor, P., Škrekovski, R.: Gray codes avoiding matchings. Discret. Math. Theor. Comput. Sci. 11, 123–148 (2009)
Dvořák, T.: Hamiltonian cycles with prescribed edges in hypercubes. SIAM J. Discret. Math. 19, 135–144 (2005)
Fink, J.: Perfect matchings extend to Hamilton cycles in hypercubes. J. Comb. Theory Ser. B 97, 1074–1076 (2007)
Fink, J.: Connectivity of matching graph of hypercube. SIAM J. Discret. Math. 23(2), 1100–1109 (2009)
Fink, J.: Matching graphs of hypercubes and complete bipartite graphs. Eur. J. Comb. 30(7), 1624–1629 (2009)
Gregor, P.: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discret. Math. 309, 1711–1713 (2009)
Gregor, P., Dvořák, T.: Path partitions of hypercubes. Inf. Process. Lett. 108, 402–406 (2008)
Gros, L.: Théorie du Baguenodier. Aimé Vingtrinier, Lyon (1872)
Havel, I.: On Hamiltonian circuits and spanning trees of hypercube. Čas. Pěst. Mat. 109, 135–152 (1984)
Kreweras, G.: Matchings and Hamiltonian cycles on hypercubes. Bull. Inst. Comb. Appl. 16, 87–91 (1996)
Ruskey, F., Savage, C.: Hamilton cycles that extend transposition matchings in Cayley graphs of \(S_{n}\). SIAM J. Discret. Math. 6(1), 152–166 (1993)
Tsai, C., Lai, Y.: Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Inf. Sci. 177, 5590–5597 (2007)
Vandenbussche, J., West, D.: Matching extendibility in hypercubes. SIAM J. Discret. Math. 23(3), 1539–1547 (2009)
Acknowledgments
The authors would like to express their gratitude to the anonymous referees for their kind suggestions on the original manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by NSFC (grant nos. 11371180 and 61073046).
Rights and permissions
About this article
Cite this article
Wang, F., Zhang, H. Small Matchings Extend to Hamiltonian Cycles in Hypercubes. Graphs and Combinatorics 32, 363–376 (2016). https://doi.org/10.1007/s00373-015-1533-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1533-6