Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an   intrinsically linked graph
  We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. 
Ramin Naimi, Elena Pavelescu and Hannah Schwartz
math.CO math.GT