相关论文: Distance $5$ Curves in the Curve Graph of Closed S…

Let $S_g$ denote a closed, orientable surface of genus $g \geq 2$ and $\mathcal{C}(S_g)$ be the associated curve complex. The mapping class group of $S_g$, $Mod(S_g)$ acts on $\mathcal{C}(S_g)$ by isometries. Since Dehn twists about certain…

Let $N_g^k$ be a nonorientable surface of genus \ $g\geq 5$ \ with \ $k$-punctures. In this note, we will give an algebraic characterization of a Dehn twist about a simple closed curve on $N_g^k$. Along the way, we will fill some little…

We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.

The complex of curves $\mathcal{C}(S_g)$ of a closed orientable surface of genus $g \geq 2$ is the simplicial complex having its vertices, $\mathcal{C}^0(S_g)$, are isotopy classes of essential curves in $S_g$. Two vertices co-bound an edge…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

In this work, we study the cellular decomposition of $S$ induced by a filling pair of curves $v$ and $w$, $Dec_{v,w}(S) = S - (v \cup w)$, and its connection to the distance function $d(v,w)$ in the curve graph of a closed orientable…

Let $S_g$ denote a closed oriented surface of genus $g \geq 2$. A set $\Omega = \{ c_1, \dots, c_d\}$ of pairwise non-homotopic simple closed curves on $S_g$ is called a filling system or simply a filling of $S_g$, if $S_g\setminus \Omega$…

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

We give new upper bounds on the stable commutator lengths of Dehn twists along separating curves in the mapping class group of a closed oriented surface. The estimates of these upper bounds are $O(1/g)$, where $g$ is the genus of the…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

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…

A \textit{multicurve} $\C$ on a closed orientable surface is defined to be a finite collection of disjoint non-isotopic essential simple closed curves. The Dehn twist $t_{\C}$ about $\C$ is the product of the Dehn twists about the…

We investigate oriented graphs based on the curve complex $C(S)$ of a closed surface $S$ and induced by functions on the vertex set of $C(S)$. In particular, we introduce the Dehn quasi-homothetic functions, which behave similarly to…

An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. We show that every 5-connected graph contains a quasi 5-contractible edge. Furthermore, we…

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…

For two oriented simple closed curves on a compact orientable surface with a connected boundary we introduce a simple computation of a value in the first homology group of the surface, which detects in some cases that the geometric…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

A new tur\'an-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any value of $n$, a graph on $n$ vertices without three vertices…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.