arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.06189math.CO
收藏

存在哈密顿路径的图是可杯堆叠的

Graphs that admit a Hamilton path are cup-stackable

Petr Gregor, Arturo Merino, Torsten Mütze, Francesco Verciani

AI总结:

本文证明存在哈密顿路径的图必为可杯堆叠图,证实了 Fay 等人的若干猜想,并进一步证明某些二部图幂的可堆叠性,同时构造出最小度和连通度任意大却完全不可堆叠的图。

摘要:

Fay、Hurlbert 和 Tennant 最近在有限连通图 $G$ 上引入了一种单人游戏,他们称之为杯堆叠(cup stacking)。杯子堆被放置在 $G$ 的顶点上,并通过堆叠移动在顶点之间转移,受到一定约束,目标是将所有杯子堆叠到单个目标顶点。如果对于 $G$ 的每个目标顶点这都可能实现,则称 $G$ 是可堆叠的。在本文中,我们证明如果 $G$ 存在哈密顿路径,则 $G$ 是可堆叠的,这证实了 Fay、Hurlbert 和 Tennant 提出的若干猜想。此外,我们证明了某些二部图的幂的可堆叠性,并构造了任意大的最小度和连通度但不允许堆叠到其任何顶点的图。

英文摘要:

Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$, which they called cup stacking. Stacks of cups are placed at the vertices of $G$, and are transferred between vertices via stacking moves, subject to certain constraints, with the goal of stacking all cups at a single target vertex. If this is possible for every target vertex of $G$, then $G$ is called stackable. In this paper, we prove that if $G$ admits a Hamilton path, then $G$ is stackable, which confirms several of the conjectures raised by Fay, Hurlbert and Tennant. Furthermore, we prove stackability for certain powers of bipartite graphs, and we construct graphs of arbitrarily large minimum degree and connectivity that do not allow stacking onto any of their vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑