Recognition: unknown
Neighbors of knots in the Gordian graph
classification
🧮 math.GT
keywords
arbitrarilybridgehighknotawaychangecrossingdistance
read the original abstract
We show that every knot is one crossing change away from a knot of arbitrarily high bridge number and arbitrarily high bridge distance.
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.