AbstractIn this paper we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete splitting number split(L) is greater than or equal to r+s−1, and less than or equal to r+split(K). In particular, we obtain from a knot by r-iterated component-lassoings an algebraically completely splittable link L with split(L)=r. Moreover, we construct a link L whose unlinking number is greater than split(L)
We investigate the minimal number of links and knots in embeddings of complete partite graphs in S3....
We introduce a new class of links for which we give a lower bound for the slice genus g∗, using the...
We investigate characteristics of two classes of links in knot theory: torus links and Klein links. ...
AbstractIn this paper we define a lassoing on a link, a local addition of a trivial knot to a link. ...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
AbstractWe construct infinitely many hyperbolic links with x-distance far from the set of (possibly,...
The splitting number of a link is the minimal number of crossing changes between different component...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
We show that the following unlinking strategy does not always yield an optimal sequence of crossing ...
AbstractA NEW combinatorial formulation of the Jones polynomial of a link is used to establish some ...
AbstractA clasp-pass move is a local move on oriented links introduced by Habiro in 1993. He showed ...
We show that for every m∈N, there exists an n∈N such that every embedding of the complete graph Kn i...
We investigate the minimal number of links and knots in embeddings of complete partite graphs in S3....
We introduce a new class of links for which we give a lower bound for the slice genus g∗, using the...
We investigate characteristics of two classes of links in knot theory: torus links and Klein links. ...
AbstractIn this paper we define a lassoing on a link, a local addition of a trivial knot to a link. ...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
The splitting number of a link is the minimal number of crossing changes between different component...
AbstractWe construct infinitely many hyperbolic links with x-distance far from the set of (possibly,...
The splitting number of a link is the minimal number of crossing changes between different component...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
We show that the following unlinking strategy does not always yield an optimal sequence of crossing ...
AbstractA NEW combinatorial formulation of the Jones polynomial of a link is used to establish some ...
AbstractA clasp-pass move is a local move on oriented links introduced by Habiro in 1993. He showed ...
We show that for every m∈N, there exists an n∈N such that every embedding of the complete graph Kn i...
We investigate the minimal number of links and knots in embeddings of complete partite graphs in S3....
We introduce a new class of links for which we give a lower bound for the slice genus g∗, using the...
We investigate characteristics of two classes of links in knot theory: torus links and Klein links. ...