Analysis of the Lifting Graph
From MaRDI portal
Abstract: The lifting graph is an auxiliary graph, useful in edge-connectivity proofs, defined via an operation called extit{lifting} performed on pairs of edges incident with a vertex in a graph . It encodes the information of whether a pair of edges incident with forms a good lift in the sense that lifting them preserves a certain prescribed local edge-connectivity between the pairs of vertices different from . Lifting was studied by Lov'asz cite{Lovasz} and Mader and they proved the first two significant results about it in 1976 and 1978 respectively, showing the existence of one good lift under certain conditions. Later in 1992 lifting was investigated further by Frank, who proved that there are many good lifts. Thomassen showed in 2016 that if is Eulerian, then the complement of is disconnected. This was extended in the same year by Ok, Richter, and Thomassen to graphs where only and are required to be even, and they began the first detailed study of the structure of the lifting graph for a general . Here we give a more comprehensive analysis of the structure of the lifting graph , studied through the interaction of its maximal independent sets, which is a new approach revealing more of the structure than seen in the inductive proof by Ok, Richter, and Thomassen. We prove specific structures for the lifting graph depending on the different possibilities for the parities of and . An important consequence is the description of the structure of a graph in case its lifting graph has a connected complement. The graph consists of a path or cycle of -edge-connected blobs, with consecutive blobs joined by precisely edges except in the case when the structure is a path of length of blobs.
This page was built for publication: Analysis of the Lifting Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419789)