Related papers: Thickness and relative hyperbolicity for graphs of…

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

Let $N$ be a connected finite type nonorientable surface with or without boundary components and punctures. We prove that the graph of nonseparating curves of $N$ is connected and Gromov hyperbolic with a constant which does not depend on…

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively…

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

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…

We study hyperbolicity for quasi-projective varieties where the boundary divisor consists of n+1 numerically parallel effective divisors on a complex projective variety of dimension n, allowing non-empty intersection. Under explicit local…

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…

We prove that the topological complexity of a finite index subgroup of a hyperbolic group is linear in its index. This follows from a more general result relating the size of the quotient of a free cocompact action of hyperbolic group on a…

A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-intersecting hypergraph has a vertex coloring with a constant…

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

A labelling of a graph is an assignment of labels to its vertex or edge sets (or both), subject to certain conditions, a well established concept. A labelling of a graph G of order n is termed a numbering when the set of integers {1,...,n}…

A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-transitive graph is maximally edge-connected. We generalise…

We classify the boundaries of hyperbolic groups that have enough quasiconvex codimension-1 surface subgroups with trivial or cyclic intersections.

We show that if an endomorphism $f:\mathbb{T}^2 \to \mathbb{T}^2$ is absolutely partially hyperbolic, then it has a center foliation. Moreover, the center foliation is leaf conjugate to that of its linearization.