ON THE COMPLEXITY OF FINITE SUBGRAPHS OF THE CURVE GRAPH

We say a graph has property P-g,P-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 chromatic and clique numbers, can provide obstructions to P-g,P-p. We introduce a new invariant of a graph, the nested complexity length, which provides a novel obstruction to P-g,P-p. For the curve graph this invariant captures the topological complexity of the surface in graph-theoretic terms; indeed we show that its value is 6g - 6 + 2p, i.e. twice the size of a maximal multicurve on the surface. As a consequence we show that large 'half-graphs' do not have P-g,P-p, and we deduce quantitatively that almost all finite graphs which pass the chromatic and clique tests do not have P-g,P-p. We also reinterpret our obstruction in terms of the first-order theory of the curve graph, and in terms of RAAG subgroups of the mapping class group (following Kim and Koberda). Finally, we show that large complete multipartite graphs cannot have P-g,P-p. This allows us to compute the upper density of the curve graph, and to conclude that clique size, chromatic number, and nested complexity length are not sufficient to determine P-g,P-p.