arXiv · math/0110174
Crossing number of links formed by edges of a triangulation
Abstract
We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not be replaced by a subexponential bound. However, if T is polytopal (resp. shellable) then there is a quadratic (resp. biquadratic) upper bound in n for the crossing number. In our proof, we use a numerical invariant p(T), called polytopality, that we have introduced in math.GT/0009216.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Simon A. King. 2001-10-17. Crossing number of links formed by edges of a triangulation. https://arxiv.org/abs/math/0110174
Cite the original work for its findings. Save a collection to share your selection of sources.