On the complexity of finite subgraphs of the curve graph

zbMath1403.57002arXiv1609.02548MaRDI QIDQ1626407

Jonah Gaster, Gabriel Conant, Edgar A. IV. Bering

Publication date: 27 November 2018

Published in: Osaka Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02548

zbMATH Keywords

clique graphgraph invariantcurve graphnested complexity length

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Relations of low-dimensional topology with graph theory (57M15) Group actions on manifolds and cell complexes in low dimensions (57M60)

Related Items (1)

Right-angled Artin groups and full subgraphs of graphs

Cites Work

• Right-angled Artin groups and finite subgraphs of curve graphs
• The structure of almost all graphs in a hereditary property
• Graph minors. XX: Wagner's conjecture
• Constructing group actions on quasi-trees and applications to mapping class groups
• Anti-trees and right-angled Artin subgroups of braid groups
• Intersection graphs of curves in the plane
• Geometry of the complex of curves. II: Hierarchical structure
• Automorphisms of graph groups.
• The number of graphs without forbidden subgraphs
• Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
• Right-angled Artin groups and a generalized isomorphism problem for finitely generated subgroups of mapping class groups
• An Obstruction to Embedding Right-Angled Artin Groups in Mapping Class Groups
• Quasi-isometrically embedded subgroups of braid and diffeomorphism groups
• On sets of integers containing k elements in arithmetic progression
• Discriminating groups and c-dimension
• Regularity lemmas for stable graphs
• On the structure of linear graphs
• The penultimate rate of growth for graph properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of finite subgraphs of the curve graph