Connectivity and W_v-paths in polyhedral maps on surfaces

From MaRDI portal
Publication:2408192



Abstract: The Wv-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the Wv-Path Conjecture is true for all 3-polytopes (3-connected plane graphs), and conjectured even more, namely that the Wv-Path Conjecture is true for all general cell complexes. This general Wv-Path Conjecture was verified for polyhedral maps on the projective plane and the torus by Barnette, and on the Klein bottle by Pulapaka and Vince. Let G be a graph polyhedrally embedded in a surface Sigma, and x,y be two vertices of G. In this paper, we show that if there are three internally disjoint (x,y)-paths which are homotopic to each other, then there exists a Wv-path joining x and y. For every surface Sigma, define a function f(Sigma) such that if for every graph polyhedrally embedded in Sigma and for a pair of vertices x and y in V(G), the local connectivity kappaG(x,y)gef(Sigma), then there exists a Wv-path joining x and y. We show that f(Sigma)=3 if Sigma is the sphere, and for all other surfaces 3−au(Sigma)lef(Sigma)le9−4chi(Sigma), where chi(Sigma) is the Euler characteristic of Sigma, and au(Sigma)=chi(Sigma) if chi(Sigma)<−1 and 0 otherwise. Further, if x and y are not cofacial, we prove that G has at least kappaG(x,y)+4chi(Sigma)−8 internally disjoint Wv-paths joining x and y. This bound is sharp for the sphere. Our results indicate that the Wv-path problem is related to both the local connectivity kappaG(x,y), and the number of different homotopy classes of internally disjoint (x,y)-paths as well as the number of internally disjoint (x,y)-paths in each homotopy class.


The paper deals with the \(W_v\)-path conjecture on closed surfaces and others. Starting by recalling the known facts about this conjecture and mentioning the equivalent conjectures in special cases, the paper continues with results giving several bounds for the values of a function \(f(\Sigma)\) defined to give a lower bound for the local connectivity of the embedded graph. Some of the formulae given for this function is related to the Euler characteristic of the underlying surface. Also, there are formulae on the number of components of the intersection of paths with a face of the graph, on the internally disjoint non-revisiting \((x,y)\)-paths, etc.











This page was built for publication: Connectivity and \(W_v\)-paths in polyhedral maps on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408192)