Geometry & Topology 5 (2001) 369–398

DOI: 10.2140/gt.2001.5.369

arXiv: math.GT/0007032

Abstract

Let T be a triangulation of S³ containing a link L in its 1–skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.

Keywords

link, triangulation, bridge number, Rubinstein–Thompson algorithm, normal surfaces

Mathematical Subject Classification

Primary: 57M25, 57Q15

Secondary: 68Q25

References

Forward citations

Publication

Received: 12 September 2000
Accepted: 8 April 2001
Published: 20 April 2001
Proposed: Walter Neumann
Seconded: Cameron Gordon, David Gabai

Authors