On the complexity of finite subgraphs of the curve graph

Edgar A. Bering, Gabriel Conant, Jonah Gaster

We say a graph has property ${\mathcal{P}}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the…