Related papers: Graphs of Systoles on hyperbolic surfaces

In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…

A graph G is list (b:a)-colorable if for every assignment of lists of size b to vertices of G, there exists a choice of an a-element subset of the list at each vertex such that the subsets chosen at adjacent vertices are disjoint. We prove…

For hyperbolic surfaces with geodesic boundary, we study the orthosystole, i.e. the length of a shortest essential arc from the boundary to the boundary. We recover and extend work by Bavard completely characterizing the surfaces maximizing…

The interaction strength I(X) of a compact hyperbolic surface X is the best upper bound for the intersection number of two closed geodesics divided by the product of their lengths. Let $M_g$ be the moduli space of compact hyperbolic…

This note addresses some questions that arise in the series of works by Kyoji Saito on the growth functions of graphs. We study "hyperbolike" graphs, which include Cayley graphs of hyperbolic groups. We generalize some well-known results on…

In this paper we study the systoles of arithmetic hyperbolic 2- and 3-manifolds. Our first result is the construction of infinitely many arithmetic hyperbolic 2- and 3-manifolds which are pairwise noncommensurable, all have the same…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can be used to deduce that their ratio has a (genus dependent)…

A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an…

We exhibit orbits of the geodesic flow on a hyperbolic surface with at least one cusp such that every tubular neighborhood contains uncountably many distinct geodesic flow orbits. The proof relies on new phenomena, namely the existence of…

We study some new isoperimetric inequalities on graphs. We etablish a relation between the volume entropy (or asymptotic volume), the systole and the first Betti number of weighted graphs. We also find bounds for the volume, associated to…

We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…

We study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang. We also give a…

We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…

This expository article discusses some connections between the geometry of a hyperbolic 3-manifold homotopy-equivalent to a surface, and the combinatorial properties of its end invariants. In particular a necessary and sufficient condition…

We consider closed hypersurfaces smoothly immersed in hyperbolic manifolds up to homotopy and commensurability. We prove that if a closed hyperbolic manifold $M$ contains a sequence of asymptotically geodesic hypersurfaces, then $\pi_1(M)$…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…