Edge-maximal graphs on orientable and some non-orientable surfaces
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, K7-e is the unique such graph on the Klein bottle N2 and K8-E(C5) is the unique such graph on the torus S1. In contrast to this for each g 2 we construct an infinite family of such graphs on the orientable surface Sg of genus g, that are g2 edges short of a triangulation.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.