pith. sign in

arxiv: 1501.05398 · v1 · pith:SXOVOPNOnew · submitted 2015-01-22 · 🧮 math.CO

Surface embedding of non-bipartite k-extendable graphs

classification 🧮 math.CO
keywords extendablegraphsnon-bipartitesigmanumbersurfacebottlebow-tie
0
0 comments X
read the original abstract

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that they are $3$-extendable. This confirms the existence of an infinite number of $3$-extendable non-bipartite graphs which can be embedded in the Klein bottle.

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.