Embedding of metric graphs on hyperbolic surfaces

DOI10.1017/S0004972719000145zbMATH Open1420.57010arXiv1703.02359OpenAlexW2732455052MaRDI QIDQ5380462FDOQ5380462

Authors: Bidyut Sanki 

Publication date: 4 June 2019

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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 $g_e(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 $g_e(G)$. Furthermore, we show that for every integer $ggeq{g}_e(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 $g_e^{max}(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 $g_e(G)$ and $g_e^{max}(G)$ are realized.

Full work available at URL: https://arxiv.org/abs/1703.02359

Recommendations

• Shortest path embeddings of graphs on surfaces
• Shortest path embeddings of graphs on surfaces
• Graphs of systoles on hyperbolic surfaces
• Stable embeddings on closed surfaces with respect to the minimum length
• Uniformizing surfaces via discrete harmonic maps

zbMATH Keywords

Betti numbergirthhyperbolic surfacefat graphBetti deficiency

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• A primer on mapping class groups
• Geometry and spectra of compact Riemann surfaces
• How to determine the maximum genus of a graph
• The embeddings of a graph—A survey
• Short loop decompositions of surfaces and the geometry of Jacobians
• Minimally intersecting filling pairs on surfaces
• The Genus of the n-Cube
• Survey of results on the maximum genus of a graph
• Graphs of systoles on hyperbolic surfaces
• Systoles and topological Morse functions for Riemann surfaces.
• The Genus, Regional Number, and Betti Number of a Graph
• Filling of closed surfaces
• Relative shapes of thick subsets of moduli space

Cited In (7)

• Shortest path embeddings of graphs on surfaces
• Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze
• Stable embeddings on closed surfaces with respect to the minimum length
• A theorem on graph embedding with a relation to hyperbolic volume
• On graph approximations of surfaces with small area
• Shortest path embeddings of graphs on surfaces
• Metric graphs elastically embeddable in the plane

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)