arXiv:1301.2931 [math.CO]AbstractReferencesReviewsResources
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Published 2013-01-14Version 1
Ruskey and Savage asked the following question: Does every matching of $Q_{n}$ for $n\geq2$ extend to a Hamiltonian cycle of $Q_{n}$? J. Fink showed that the question is true for every perfect matching, and solved the Kreweras' conjecture. In this paper we consider the question in hypercubes with faulty edges. We show that every matching $M$ of at most $2n-1$ edges can be extended to a Hamiltonian cycle of $Q_{n}$ for $n\geq2$. Moreover, we can prove that when $n\geq4$ and $M$ is nonempty this result still holds even if $Q_{n}$ has at most $n-1-\lceil\frac{|M|}{2}\rceil$ faulty edges with one exception.
Comments: 16 pages, 10 figures
Related articles: Most relevant | Search more
A new result on the problem of Buratti, Horak and Rosa
arXiv:1205.5492 [math.CO] (Published 2012-05-24)
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi