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 , is the unique such graph on the Klein bottle and is the unique such graph on the torus . In contrast to this for each we construct an infinite family of such graphs on the orientable surface of genus , that are edges short of a triangulation.
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