English

Edge-maximal graphs on orientable and some non-orientable surfaces

Combinatorics 2019-11-11 v1

Abstract

We study edge-maximal, non-complete graphs on surfaces that do not triangulate the surface. We prove that there is no such graph on the projective plane N1\mathbb{N}_1, K7eK_7-e is the unique such graph on the Klein bottle N2\mathbb{N}_2 and K8E(C5)K_8-E(C_5) is the unique such graph on the torus S1\mathbb{S}_1. In contrast to this for each g2g\ge 2 we construct an infinite family of such graphs on the orientable surface Sg\mathbb{S}_g of genus gg, that are g2\lfloor \frac{g}{2} \rfloor edges short of a triangulation.

Keywords

Cite

@article{arxiv.1911.02666,
  title  = {Edge-maximal graphs on orientable and some non-orientable surfaces},
  author = {James Davies and Florian Pfender},
  journal= {arXiv preprint arXiv:1911.02666},
  year   = {2019}
}

Comments

18 pages, 19 figures

R2 v1 2026-06-23T12:07:59.986Z