Related papers: Distance in the curve graph

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…

We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…

We study how the length and the twisting parameter of a curve change along a Teichmuller geodesic. We then use our results to provide a formula for the Teichmuller distance between two hyperbolic metrics on a surface, in terms of the…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Let $S$ be an orientable surface with negative Euler characteristic. For $k \in \mathbb{N}$, let $\mathcal{C}_{k}(S)$ denote the $\textit{k-curve graph}$, whose vertices are isotopy classes of essential simple closed curves on $S$, and…

A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…

Let $S_g$ denote a closed, orientable surface of genus $g \geq 2$ and $\mathcal{C}(S_g)$ be the associated curve graph. Let $d$ be the path metric on $\mathcal{C}(S_g)$ and $a_0$ and $a_4$ be a pair of curves on $S_g$ with $d(a_0, a_4) =…

We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…

In this paper we obtain new estimates of the number of edges in subgraphs of the special distance graph. Bibliography: 21 item.

In this work authors significantly improved previous estimates of the number of edges in subgraphs of the special distance graph.

We consider several natural sets of curves associated to a given Teichm\"uller disc, such as the systole set or cylinder set, and study their coarse geometry inside the curve graph. We prove that these sets are quasiconvex and agree up to…

In this survey paper we give a proof of hyperbolicity of the complex of curves for a non-exceptional surface S of finite type combining ideas of Masur/Minsky and Bowditch. We also shortly discuss the relation between the geometry of the…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

In this article, the author proposes a new approach for the estimating of the number of edges in induced subgraphs of a special distance graph. Author significantly improves previous estimates and suggests a new approach to obtaining better…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.

The distance of a vertex in a graph is the sum of distances from that vertex to all other vertices of the graph. The Wiener index of a graph is the sum of distances between all its unordered pairs of vertices. A graph has been obtained that…

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

For two measured laminations $\nu^+$ and $\nu^-$ that fill up a hyperbolizable surface $S$ and for $t \in (-\infty, \infty)$, let $L_t$ be the unique hyperbolic surface that minimizes the length function $e^t l(\nu^+) + e^{-t} l(\nu^-)$ on…

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…