Local geometry of the k-curve graph
Tarik Aougab

TL;DR
This paper explores the local geometry of k-curve graphs on surfaces, revealing bounds on clique sizes, link intersections, and diameters, linking geometric and combinatorial properties.
Contribution
It introduces new bounds on clique numbers and link intersections in k-curve graphs, connecting Teichmüller space geometry with combinatorial graph properties.
Findings
Clique number of -curve graph grows exponentially with k
Maximum link intersection size is quasi-polynomial in k
Diameter of large cliques in -curve graph is uniformly bounded
Abstract
Let be an orientable surface with negative Euler characteristic. For , let denote the , whose vertices are isotopy classes of essential simple closed curves on , and whose edges correspond to pairs of curves that can be realized to intersect at most times. The theme of this paper is that the geometry of Teichm\"uller space and of the mapping class group captures local combinatorial properties of . Using techniques for measuring distance in Teichm\"uller space, we obtain upper bounds on the following three quantities for large : the clique number of (exponential in , which improves on all previously known bounds and which is essentially sharp); the maximum size of the intersection, whenever it is finite, of a pair of links in (quasi-polynomial in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Geometric Analysis and Curvature Flows · Geometry and complex manifolds
