1-slim triangles and uniform hyperbolicity for arc graphs and curve graphs

被引：60

作者：

Hensel, Sebastian ^{[1
]}

Przytycki, Piotr ^{[2
,3
]}

Webb, Richard C. H. ^{[4
]}

机构：

[1] Univ Chicago, Dept Math, Chicago, IL 60637 USA

[2] McGill Univ, Dept Math & Stat, Montreal, PQ H3A 0B9, Canada

[3] Polish Acad Sci, Inst Math, PL-00656 Warsaw, Poland

[4] UCL, Dept Math, London WC1E 6BT, England

来源：

JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY | 2015年 / 17卷 / 04期

关键词：

Gromov hyperbolic; slim triangle; curve graph; arc graph; unicorn; KLEINIAN SURFACE GROUPS; GEOMETRY; CLASSIFICATION; CONNECTIVITY; DIMENSION; COMPLEX; SPACE;

D O I：

10.4171/JEMS/517

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe unicorn paths in the arc graph and show that they form 1-slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7-hyperbolic. Considering the same paths in the arc and curve graph, this also shows that all curve graphs are 17-hyperbolic, including closed surfaces.

引用

页码：755 / 762

页数：8

共 36 条

[21] EFFICIENT PARALLEL RECOGNITION OF SOME CIRCULAR ARC GRAPHS .1.
CHEN, L
ALGORITHMICA, 1993, 9 (03) : 217 - 238
[22] Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles
Jin, Jing
Xu, Baogang
ARS COMBINATORIA, 2017, 135 : 71 - 81
[23] CHARACTERIZATION OF 1-UNIFORM dcsl GRAPHS AND WELL GRADED FAMILY OF SETS
Germina, K. A.
James, Jinto
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2015, 15 (02): : 113 - 123
[24] (Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles
Chang, Gerard J.
Roussel, Nicolas
DISCRETE MATHEMATICS, 2012, 312 (14) : 2126 - 2130
[25] The result on (3,1)*-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles
Zhang, Haihui
ARS COMBINATORIA, 2015, 121 : 353 - 360
[26] RIGOROUS ESTIMATES OF GENERAL MAYER GRAPHS AND APPLICATIONS .1. UNIFORM UPPER BOUNDS
LAVAUD, M
PHYSICS LETTERS A, 1977, 62 (05) : 295 - 297
[27] Vertex-Primitive1/2-arc-transitive graphs of smallest order
Du, SF
Xu, MY
COMMUNICATIONS IN ALGEBRA, 1999, 27 (01) : 163 - 171
[28] Surjective L(2,1)-labeling of cycles and circular-arc graphs
Amanathulla, Sk
Pal, Madhumangal
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 35 (01) : 739 - 748
[29] Vertex-disjoint triangles in K1,t-free graphs with minimum degree at least t
Zhang, Xin
Li, Na
Wu, Jian-Liang
Yan, Jin
DISCRETE MATHEMATICS, 2010, 310 (19) : 2499 - 2503
[30] Distance-Regular Graphs with Classical Parameters that Support a Uniform Structure: Case q ≤ 1
Fernandez, Blas
Maleki, Roghayeh
Miklavic, Stefko
Monzillo, Giusy
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2023, 46 (06)

← 1 2 3 4 →