Every graph is a cut locus (Q500097): Difference between revisions

This short and elegant paper shows that every connected length graph can be realized (isometrically) as the cut locus of a point on a closed Riemannian surface. Moreover, if the graph is cyclic and regular, then this surface can be arranged to have constant curvature. Finally, the stability and generic behavior of this realization are also studied. The proof of the main result is by induction on the number of generating cycles of the graph, and uses a deformation result of \textit{A. D. Weinstein} [Ann. Math. (2) 87, 29--41 (1968; Zbl 0159.23902)].