![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Mapping Class Groups and Interpolating Complexes:Rank
Subscribe/Renew Journal
A family of interpolating graphs C(S, ξ) of complexity ξ is constructed for a surface S and -2 ≤ ξ ≤ ξ(S). For ξ =-2,-1, ξ(S)-1 these specialize to graphs quasi-isometric to the marking graph, the pants graph and the curve graph respectively. We generalize the notion of a hierarchy and Theorems of Brock–Farb and Behrstock–Minsky to show that the rank of C(S, ξ) is rξ, the largest number of disjoint copies of subsurfaces of complexity greater than ξ that may be embedded in S. The interpolating graphs C(S,ξ) interpolate between the pants graph and the curve graph.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 162
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1