平面生成树路径重配置的进一步连通性结果
Further Connectivity Results on Plane Spanning Path Reconfiguration
AI总结:
本文研究平面生成树路径重配置图的连通性猜想,证明了当点集除一点外均处于凸位置时图连通且直径至多为2|S|,并证明每个连通分支至少含3个顶点。
摘要:
给定一个有限点集 $S$,我们考虑如下的重配置图:其顶点为 $S$ 的平面生成树路径,若两条对应路径相差两条边(移除一条、添加一条),则两个顶点之间连边。自2007年以来,该图被猜想是连通的,但一直未找到证明。本文证明了若干支持该猜想的结果。主要地,我们证明:若 $S$ 中除一个点外其余所有点均处于凸位置,则该图连通且直径至多为 $2|S|$;并且当 $|S| \geq 3$ 时,每个连通分支至少包含 $3$ 个顶点。
英文摘要:
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one removed, one added). Since 2007, this graph is conjectured to be connected but no proof has been found. In this paper, we prove several results to support the conjecture. Mainly, we show that if all but one point of $ S $ are in convex position, then the graph is connected with diameter at most $ 2 | S | $ and that for $ | S | \geq 3 $ every connected component has at least $ 3 $ vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。