Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph

Ramin Naimi, Elena Pavelescu, Hannah Schwartz

We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.