跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.11476 · v1

On the Complexity of Extending Prescribed Linear Forests to Hamiltonian Cycles in Hypercubes

首次提交 2026-11-09 00:15
版本更新 2026-11-09 00:15
雷达观测 2026-11-10 12:16
arXiv ↗PDF ↗

摘要

Let QnQ_n be the nn-dimensional hypercube, and let P⊆E(Qn)P\subseteq E(Q_n) be a set of prescribed edges. It is known that, for n≥2n\ge 2, every such set PP with ∣P∣≤2n−3|P|\leq 2n-3 whose edges form a linear forest is contained in a Hamiltonian cycle of QnQ_n. This bound is sharp for general linear forests. The computational complexity of deciding whether a prescribed edge set of a hypercube can be extended to a Hamiltonian cycle was posed as an open question by Dvořák [SIAM J. Discrete Math. 19 (2005) 135--144]. We prove that the problem is NP-complete even when the prescribed edges form a spanning linear forest with no isolated vertices. We give a polynomial-time reduction from a restricted 3-SAT problem, using local spanning path-forest gadgets for variables and clauses that are uniformly embedded in the hypercube. The same reduction therefore establishes NP-hardness of two versions of Hamiltonian-cycle extension problems for general prescribed edge sets.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-09 00:15 · 最新观测版本

On the Complexity of Extending Prescribed Linear Forests to Hamiltonian Cycles in Hypercubes

Let QnQ_n be the nn-dimensional hypercube, and let P⊆E(Qn)P\subseteq E(Q_n) be a set of prescribed edges. It is known that, for n≥2n\ge 2, every such set PP with ∣P∣≤2n−3|P|\leq 2n-3 whose edges form a linear forest is contained in a Hamiltonian cycle of QnQ_n. This bound is sharp for general linear forests. The computational complexity of deciding whether a prescribed edge set of a hypercube can be extended to a Hamiltonian cycle was posed as an open question by Dvořák [SIAM J. Discrete Math. 19 (2005) 135--144]. We prove that the problem is NP-complete even when the prescribed edges form a spanning linear forest with no isolated vertices. We give a polynomial-time reduction from a restricted 3-SAT problem, using local spanning path-forest gadgets for variables and clauses that are uniformly embedded in the hypercube. The same reduction therefore establishes NP-hardness of two versions of Hamiltonian-cycle extension problems for general prescribed edge sets.

查看此版本解读 →查看此版本原文 ↗