有界度图中远离哈密顿性的显式构造
An explicit construction of graphs of bounded degree that are far from being Hamiltonian
AI总结:
本文显式构造了一类有界度图,它们局部哈密顿但全局远离哈密顿性,为单侧误差性质测试器提供了线性查询复杂度的确定性困难实例。
摘要:
哈密顿圈在图中的研究始于19世纪50年代。自那时起,大量研究致力于识别允许哈密顿圈的图类以及相关问题。相应的决策问题——即给定图是否为哈密顿图(即是否存在哈密顿圈)——是卡普著名的NP完全问题之一。本文研究有界度图中“远离”哈密顿性的图,其中,若要使一个具有n个顶点的图G成为哈密顿图,必须修改n条边的常数比例,则称G“远离”哈密顿性。我们给出了一个有界度图类的显式确定性构造,该类图是局部哈密顿的,但(全局)远离哈密顿性。此处,“局部哈密顿”意味着由小顶点集的邻域诱导的每个子图都出现在某个哈密顿图中。更精确地说,我们得到的图与任何哈密顿图在Θ(n)条边上不同,但非哈密顿性无法在o(n)个顶点的邻域内被检测到。我们的图类为具有线性查询复杂度的单侧误差性质测试器提供了一类困难实例。已知任何性质测试器(即使是双侧误差)测试哈密顿性都需要线性数量的查询(Yoshida, Ito, 2010)。这是通过随机构造困难实例证明的。相比之下,我们的构造是确定性的。迄今为止,仅知道很少的确定性构造用于性质测试的困难实例。我们相信,我们的构造可能为图论带来未来的见解,并有助于刻画在有界度模型中可测试的性质。
英文摘要:
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding decision problem, that asks whether a given graph is Hamiltonian (i.\,e.\ admits a Hamiltonian cycle), is one of Karp's famous NP-complete problems. In this paper we study graphs of bounded degree that are \emph{far} from being Hamiltonian, where a graph $G$ on $n$ vertices is \emph{far} from being Hamiltonian, if modifying a constant fraction of $n$ edges is necessary to make $G$ Hamiltonian. We give an explicit deterministic construction of a class of graphs of bounded degree that are locally Hamiltonian, but (globally) far from being Hamiltonian. Here, \emph{locally Hamiltonian} means that every subgraph induced by the neighbourhood of a small vertex set appears in some Hamiltonian graph. More precisely, we obtain graphs which differ in $Θ(n)$ edges from any Hamiltonian graph, but non-Hamiltonicity cannot be detected in the neighbourhood of $o(n)$ vertices. Our class of graphs yields a class of hard instances for one-sided error property testers with linear query complexity. It is known that any property tester (even with two-sided error) requires a linear number of queries to test Hamiltonicity (Yoshida, Ito, 2010). This is proved via a randomised construction of hard instances. In contrast, our construction is deterministic. So far only very few deterministic constructions of hard instances for property testing are known. We believe that our construction may lead to future insights in graph theory and towards a characterisation of the properties that are testable in the bounded-degree model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。