Related papers: Graphs of Systoles on hyperbolic surfaces
This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
A pancyclic graph is a graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. In this paper, we establish some new sufficient conditions for a graph to be pancyclic in terms of the edge…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
Let $t$ be a positive real number. A graph is called \emph{$t$-tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…
Given a compact surface $\Sigma$ with boundary and a relation $\Gamma$ on $\pi_0(\partial\Sigma)$, we define the prescribed arc graph $\mathscr A(\Sigma,\Gamma)$ to be the full subgraph of the arc graph $\mathscr A(\Sigma)$ containing only…
For an iterated function system (IFS) of simillitidues, we define two graphs on the representing symbolic space. We show that if the self-similar set $K$ has positive Lebesgue measure or the IFS satisfies the weak separation condition, then…
On a closed Riemannian surface of negative curvature, we prove a characterization for configurations of closed geodesics arising from one parameter Allen-Cahn min-max constructions. One of the facts we conclude is that every geodesic occurs…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
The aim of this note is to give the simplest possible proof that Mapping Class Groups of closed hyperbolic surfaces are acylindrically hyperbolic, and more specifically that their curve graphs are hyperbolic and that pseudo-Anosovs act on…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific…
A well known question of Gromov asks whether every one-ended hyperbolic group $\Gamma$ has a surface subgroup. We give a positive answer when $\Gamma$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result,…
We show that the asymptotic dimension of a hyperbolic relatively hyperbolic graph is finite provided that this holds true uniformly for the peripheral subgraphs and for the electrifiation. We use this to show that the asymptotic dimension…
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…