arXiv · math/9905172
A criterion for almost alternating links to be non-splittable
Abstract
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing numbers of crossings of diagrams in the process. Moreover, we show that almost alternating links with more than two components are non-trivial.
Explore related subjects
Keep this discovery
Tatsuya Tsukamoto. 1999-05-27. A criterion for almost alternating links to be non-splittable. https://arxiv.org/abs/math/9905172
Cite the original work for its findings. Save a collection to share your selection of sources.