Connectivity and $W_v$-Paths in Polyhedral Maps on Surfaces
Abstract
The -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 -Path Conjecture is true for all 3-polytopes (3-connected plane graphs), and conjectured even more, namely that the -Path Conjecture is true for all general cell complexes. This general -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 be a graph polyhedrally embedded in a surface , and be two vertices of . In this paper, we show that if there are three internally disjoint -paths which are homotopic to each other, then there exists a -path joining and . For every surface , define a function such that if for every graph polyhedrally embedded in and for a pair of vertices and in , the local connectivity , then there exists a -path joining and . We show that if is the sphere, and for all other surfaces , where is the Euler characteristic of , and if and 0 otherwise. Further, if and are not cofacial, we prove that has at least internally disjoint -paths joining and . This bound is sharp for the sphere. Our results indicate that the -path problem is related to both the local connectivity , and the number of different homotopy classes of internally disjoint -paths as well as the number of internally disjoint -paths in each homotopy class.
Cite
@article{arxiv.1611.06402,
title = {Connectivity and $W_v$-Paths in Polyhedral Maps on Surfaces},
author = {Michael D. Plummer and Dong Ye and Xiaoya Zha},
journal= {arXiv preprint arXiv:1611.06402},
year = {2018}
}
Comments
14 pages, 6 figures