A newly recognized intrinsically knotted graph

Abstract

Abstract In [Adams, 1994 ; The Knot Book], Colin Adams states as an open question whether removing a vertex and all edges incident to that vertex from an intrinsically knotted graph must yield an intrinsically linked graph. In this paper, we exhibit an intrinsically knotted graph for which there is a vertex that can be removed, and the resulting graph is not intrinsically linked. We further show that this graph is minor minimal with respect to being intrinsically knotted. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 199–209, 2003