The minimum crossing number of essential tangles

From MaRDI portal



Abstract: In this paper we compute the sharp lower bounds for the crossing number of n-string k-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted strings.











This page was built for publication: The minimum crossing number of essential tangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934373)