从迭线图上的渗流理论视角看圈双覆盖猜想
The cycle double cover conjecture from the perspective of percolation theory on iterated line graphs
AI总结:
本文从渗流理论视角出发,利用迭线图将游走和圈映射为边集合,通过翻转{0,1}标签技术证明了圈双覆盖猜想。
摘要:
圈双覆盖猜想是图论中长期存在的问题,它将局部性质(顶点的度数且无桥边)与图的全局性质(被特定圈集合覆盖)联系起来。我们通过将 G 中的游走和圈提升为 L(L(G))(G 的线图的线图)上的开边和闭边集合来证明该猜想。利用线图算子保持三角形的性质,获得了从底层图 G 中的游走到 L(L(G)) 上游走的一一映射。我们证明了 G 中的每个“双游走覆盖”集合都会在 L(L(G)) 减去一组三角形的子图覆盖上诱导出特定的 {0,1} 标签集合;反之,若 G 是简单无桥无三角形三正则图,则存在这样的标签集合,其向 G 的投影意味着双圈覆盖。所应用的技术受渗流理论启发,通过翻转 {0,1} 标签来获得所需结构。
英文摘要:
The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove the conjecture using a lift of walks and cycles in $G$ to sets of open and closed edges on $\mathcal{L}(\mathcal{L}(G))$, the line graph of the line graph of $G$. We exploit that triangles are preserved by the line graph operator to obtain a one-to-one mapping from walks in the underlying graph $G$ to walks on $\mathcal{L}(\mathcal{L}(G))$. We prove that each set of "double walk covers" in $G$ induces a certain set of $\lbrace 0,1\rbrace$ labels on a subgraph covering of $\mathcal{L}(\mathcal{L}(G))$, minus a set of triangles, and conversely, that there is such a set of labels such that its projection back to $G$ implies a double cycle cover, if $G$ is an simple bridgeless triangle-free cubic graph. The techniques applied are inspired by percolation theory, flipping the $\lbrace 0,1\rbrace$ labels to obtain the desired structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。