pith. sign in

arxiv: 1509.00269 · v1 · pith:2JHXFQBBnew · submitted 2015-09-01 · 💻 cs.CG · cs.DM

Some Triangulated Surfaces without Balanced Splitting

classification 💻 cs.CG cs.DM
keywords splittingcyclecomponentsconjecturesigmatriangulatedtypebalanced
0
0 comments X
read the original abstract

Let G be the graph of a triangulated surface $\Sigma$ of genus $g\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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.