Every graph is a cut locus
classification
🧮 math.DG
keywords
someeverygraphlocusbehaviorcasesconnectedconstant
read the original abstract
We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.