提升图的分析
Analysis of the Lifting Graph
AI总结:
本文对图论中提升图的结构进行了更全面的分析,涵盖了提升操作的历史背景、重要定理及其在连通性增广和无限图定向等领域的应用。
摘要:
图上的“提升”或“分裂”操作是通过删除两条具有公共端点 s 的边 sv 和 sw,并在 v 和 w 之间添加一条新边来执行的。如果这种提升能够保持发生提升的顶点 s 以外的不同顶点对之间的某种局部边连通性,则称该提升是好的。该操作对于关于边连通性的归纳证明非常重要,在关于连通性增广、网络设计、(有限图和无限图的)定向以及边不相交连接的文献中得到了广泛应用。Lovasz(使用术语 splitting-off)和 Mader(使用术语 lifting)对此进行了研究。他们分别于 1976 年和 1978 年证明了关于它的前两个重要结果,展示了在某些条件下存在好的提升。随后在 20 世纪 80 年代,其他研究者对其进行了使用和研究,涵盖了无向图和有向图。特别是,Frank 进一步研究了它,并在 1992 年证明了存在 floor(deg(s)/2) 个不相交的好提升。受应用的推动,Jordan 在 20 世纪 90 年代末引入了一种研究该操作的新方法。他定义并研究了“不可容许”图的结构,即提升图的补图;这也是本文的主题。他证明了关于它的一些重要结构结果,并将其应用于连通性增广。独立地,在 2016 年,Thomassen 定义了“提升图”,并将其补图称为“坏图”,以将其应用于寻找无限图的定向。同年后些时候,Thomassen 与 Ok 和 Richter 扩展了该研究,并将他们的结果应用于无限图中的连接。在此,我们对提升图的结构进行了更全面的分析。
英文摘要:
The `lifting` or `splitting-off` operation on graphs is performed by deleting two edges sv and sw having a common end s and adding a new edge between v and w. Such a lift is considered good if it preserves a certain local edge-connectivity between the pairs of vertices different from the vertex s at which lifting takes place. The operation is important for inductive proofs concerning edge-connectivity, and can be seen widely applied in the literature on connectivity augmentation, network design, orientation (of finite and infinite graphs), and edge-disjoint linkage. It was studied by Lovasz, who used the term splitting-off, and Mader, who used the term lifting. They proved the first two significant results on it, in 1976 and 1978 respectively, showing the existence of a good lift under certain conditions. Then it was used and studied by other researchers, through the 1980s, both for undirected and directed graphs. In particular, it was investigated further by Frank who proved in 1992 that there are floor of deg(s)/2 disjoint good lifts. Motivated by the applications, a new method for studying the operation was introduced by Jordan in the late 1990s. He defined and studied the structure of the `non-admissibility` graph, which is the complement of the lifting graph; the subject of this paper. He proved a number of significant structural results on it, which he applied to connectivity augmentation. Independently, in 2016, Thomassen defined the `lifting graph`, and called its complement the `bad graph`, to apply it in finding orientations of infinite graphs. Later in the same year, Thomassen with Ok and Richter extended the study, and applied their results to linkages in infinite graphs. Here we give a more comprehensive analysis of the structure of the lifting graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。