Connectivity and Wv-Paths in Polyhedral Maps on Surfaces

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 , 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 , define a function f() such that if for every graph polyhedrally embedded in and for a pair of vertices x and y in V(G), the local connectivity G(x,y) f(), then there exists a Wv-path joining x and y. We show that f()=3 if is the sphere, and for all other surfaces 3-τ() f() 9-4(), where () is the Euler characteristic of , and τ()=() if ()< -1 and 0 otherwise. Further, if x and y are not cofacial, we prove that G has at least G(x,y)+4()-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 G(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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…