Ravels arising from Montesinos Tangles
classification
🧮 math.GT
keywords
montesinosravelarisingbecomecharacterizeclosurecontainscrossings
read the original abstract
A ravel is a spatial graph which is non-planar but contains no non-trivial knots or links. We characterize when a Montesinos tangle can become a ravel as the result of vertex closure with and without replacing some number of crossings by vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.