English

Some Triangulated Surfaces without Balanced Splitting

Computational Geometry 2015-09-02 v1 Discrete Mathematics

Abstract

Let G be the graph of a triangulated surface Σ\Sigma of genus g2g\geq 2. A cycle of G is splitting if it cuts Σ\Sigma into two components, neither of which is homeomorphic to a disk. A splitting cycle has type k if the corresponding components have genera k and g-k. It was conjectured that G contains a splitting cycle (Barnette '1982). We confirm this conjecture for an infinite family of triangulations by complete graphs but give counter-examples to a stronger conjecture (Mohar and Thomassen '2001) claiming that G should contain splitting cycles of every possible type.

Cite

@article{arxiv.1509.00269,
  title  = {Some Triangulated Surfaces without Balanced Splitting},
  author = {Vincent Despré and Francis Lazarus},
  journal= {arXiv preprint arXiv:1509.00269},
  year   = {2015}
}

Comments

15 pages, 7 figures

R2 v1 2026-06-22T10:46:22.519Z