arXiv · 2610.40168
Optimal subtrees of finite metric graphs
Abstract
We consider a metric graph analog of a classical extremal problem for Riemann surfaces studied by Teichmüller, Jenkins, Strebel, and others. In particular, we prove that on any finite metric graph with a marked point, there is a unique open subtree which maximizes a metric graph analog of the reduced modulus, and we also give an equivalent characterization of this optimal subtree in terms of balanced harmonic measures.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Levi Haunschmid-Sibitz, Fredrik Viklund, David Witt Nyström. 2026-10-29. Optimal subtrees of finite metric graphs. https://arxiv.org/abs/2610.40168
Cite the original work for its findings. Save a collection to share your selection of sources.