Determining the finite subgraphs of curve graphs
Tarik Aougab
Brown University, Providence, USAIan Biringer
Boston College, Chestnut Hill, USAJonah Gaster
McGill University, Montreal, Canada
Abstract
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
Cite this article
Tarik Aougab, Ian Biringer, Jonah Gaster, Determining the finite subgraphs of curve graphs. Groups Geom. Dyn. 13 (2019), no. 1, pp. 31–45
DOI 10.4171/GGD/478