Related papers: Graphs of Systoles on hyperbolic surfaces
We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
We classify hyperbolic polynomials in two real variables that admit a transitive action on some component of their hyperbolic level sets. Such surfaces are called special homogeneous surfaces, and they are equipped with a natural Riemannian…
In this paper we examine the geometry of minimal surfaces of arithmetic hyperbolic 3-manifolds. In particular, we give bounds on the totally geodesic 2-systole, construct infinitely many incommensurable manifolds with the same initial…
We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
In 1962, Oystein Ore asked in which graphs there is exactly one geodesic between any two vertices. He called such graphs geodetic. In this paper, we systematically study properties of geodetic graphs, and also consider antipodal graphs, in…
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
The main goal of this note is to show that the study of closed hyperbolic surfaces with maximum length systole is in fact the study of surfaces with maximum length homological systole. The same result is shown to be true for once-punctured…
Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…
If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…
Let G be a word-hyperbolic group, obtained as a graph of free groups amalgamated along cyclic subgroups. If H_2(G;Q) is nonzero, then G contains a closed hyperbolic surface subgroup. Moreover, the unit ball of the Gromov-Thurston norm on…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
It is a longstanding problem to determine the precise relationship between the geodesic length spectrum of a hyperbolic manifold and its commensurability class. A well known result of Reid, for instance, shows that the geodesic length…