Mapping Class Groups and Interpolating Complexes: Rank
arXiv:0706.2740
Abstract
A family of interpolating graphs $\calC (S, ξ)$ of complexity is constructed for a surface and . For these specialise to graphs quasi-isometric to the marking graph, the pants graph and the curve graph respectively. We generalise Theorems of Brock-Farb and Behrstock-Minsky to show that the rank of $\calC (S, ξ)$ is , the largest number of disjoint copies of subsurfaces of complexity greater than that may be embedded in . The interpolating graphs $\calC (S, ξ)$ interpolate between the pants graph and the curve graph.
v2 Final version incorporating refree comments 16pgs no figs