“…We will generalize this result to link and graph complements, with the additional benefit of avoiding many of the technical details of [7] necessary to treat the boundary components. Unfortunately, our bound will be worse than that obtained by Bachman and Schleimer, though it will be sufficient for many applications of this type of bound (e.g., [20], [15], [22], [5], and [21]). We note also that our proof requires a minimal starting position similar to that used by Hartshorn, an assumption the Bachman-Schleimer method was able to avoid.…”