arXiv · 2506.18838
Subgraph Entropy
Abstract
Given $r \geq 3$, we prove that there exists $\lambda >0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $\lambda$. This answers a question of the second two authors together with Rieck. We interpret this as a graph theoretic version of the Bers Lemma from hyperbolic geometry, and explain some connections to the pressure metric on the Culler-Vogtmann Outer Space.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tarik Aougab, Matt Clay, Tawfiq Hamed. 2025-06-23. Subgraph Entropy. https://arxiv.org/abs/2506.18838
Cite the original work for its findings. Save a collection to share your selection of sources.