Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
arXiv:1407.0297
Abstract
We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.
arXiv commentThe authors found an error in the proof of Proposition 2. They also found a counterexample to Proposition 2