2015/03/06 by Sanki, Bidyut, Gadgil, Siddhartha · 1 citation
#FOS: Mathematics #Geometric Topology (math.GT)
paper · doi:10.48550/arxiv.1503.01891
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface (we call these admissible). There is a natural necessary condition on such graphs, which we call combinatorial admissibility. Our first main result is that this condition is also sufficient. It follows that a sub-graph of an admissible graph is admissible. Our second major result is that there are infinitely many minimal non-admissible fat graphs (in contrast, for instance, to the classical result that there are only two minimal non-planar graphs).