Intrinsically Knotted and 3-Linked Graph

Abstract

Intrinsically linked graphs are very important spatial graphs. We say that is intrinsically knotted and 3-linked graph if every spatial embedding of this graph contains nontrivial knot and a non-split 3-component link. This paper exhibit a new intrinsically knotted and 3-linked graph. This paper is devoted to the operation of the exchanges preserve intrinsically knotted and 3-linked graph.