Embedding of metric graphs on hyperbolic surfaces

From MaRDI portal
Publication:5380462




Abstract: An embedding of a metric graph (G,d) on a closed hyperbolic surface is emph{essential}, if each complementary region has a negative Euler characteristic. We show, by construction, that given any metric graph, its metric can be rescaled so that it admits an essential and isometric embedding on a closed hyperbolic surface. The essential genus ge(G) of (G,d) is the lowest genus of a surface on which such an embedding is possible. In the next result, we establish a formula to compute ge(G). Furthermore, we show that for every integer ggeqge(G), (G,d) admits such an embedding (possibly after a rescaling of d) on a surface of genus g. Next, we study minimal embeddings where each complementary region has Euler characteristic 1. The maximum essential genus gemax(G) of (G,d) is the largest genus of a surface on which the graph is minimally embedded. Finally, we describe a method explicitly for an essential embedding of (G,d), where ge(G) and gemax(G) are realized.









This page was built for publication: Embedding of metric graphs on hyperbolic surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380462)