Valentino Boucard, Guilherme D. da Fonseca, Bastien Rivier
{"title":"Further Connectivity Results on Plane Spanning Path Reconfiguration","authors":"Valentino Boucard, Guilherme D. da Fonseca, Bastien Rivier","doi":"arxiv-2407.00244","DOIUrl":null,"url":null,"abstract":"Given a finite set $ S $ of points, we consider the following reconfiguration\ngraph. The vertices are the plane spanning paths of $ S $ and there is an edge\nbetween two vertices if the two corresponding paths differ by two edges (one\nremoved, one added). Since 2007, this graph is conjectured to be connected but\nno proof has been found. In this paper, we prove several results to support the\nconjecture. Mainly, we show that if all but one point of $ S $ are in convex\nposition, then the graph is connected with diameter at most $ 2 | S | $ and\nthat for $ | S | \\geq 3 $ every connected component has at least $ 3 $\nvertices.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"729 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.00244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
