|
Download This Article
|
|
with up-to-date links in citations
|
| For printing |
|
Recent Issues |
|
Volume 1, 1997 |
|
Volume 2, 1998 |
|
Volume 3, 1999 |
|
Volume 4, 2000 |
|
Volume 5, 2001 |
|
Volume 6, 2002 |
|
Volume 7, 2003 |
|
Volume 8, 2004 |
|
Volume 9, 2005 |
|
Volume 10, 2006 |
|
Volume 11, 2007 |
|
Volume
12(1) 2008 |
|
Volume
12(2) 2008 |
|
Volume
12(3) 2008 |
|
Volume
12(4) 2008 |
|
Volume
12(5) 2008 |
|
Volume
13(1) 2009 |
|
Volume
13(2) 2009 |
|
Volume
13(3) 2009 |
|
Volume
13(4) 2009 |
|
Volume
13(5) 2009 |
|
Volume
14(1) 2010 |
|
Volume
14(2) 2010 |
|
G&T Monographs |
|
|
|
The size of triangulations supporting a given link
Simon A King
|
|
Geometry & Topology 5 (2001)
369–398
|
Abstract
|
|
Let T be a triangulation of S3 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
|
Publication
Received: 12 September 2000
Accepted: 8 April 2001
Published: 20 April 2001
Proposed: Walter Neumann
Seconded: Cameron Gordon, David Gabai
|
|
