It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph.We present a new intrinsically knotted graph that shows the answer to both questions is no.
No takes yet. Share an insight, caveat, or question.
Mattman et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: