Graphs of systoles on hyperbolic surfaces
2019 ◽
Vol 11
(01)
◽
pp. 1-20
◽
Keyword(s):
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal forms 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).
2018 ◽
Vol 98
(3)
◽
pp. 502-511
Keyword(s):
2019 ◽
Vol 99
(03)
◽
pp. 508-520
1991 ◽
Vol 34
(2)
◽
pp. 251-257
◽
2011 ◽
Vol 32
(2)
◽
pp. 643-651
◽
Keyword(s):
2017 ◽
Vol 166
(1)
◽
pp. 83-121
Keyword(s):
2008 ◽
Vol 168
(1)
◽
pp. 97-125
◽
2012 ◽
Vol 33
(4)
◽
pp. 1162-1177
Keyword(s):
2008 ◽
Vol Vol. 10 no. 1
(Combinatorics)
◽