Intrinsically knotted graphs with linklessly embeddable simple minors
arXiv:2111.08859 · doi:10.2140/agt.2024.24.1203
Abstract
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.
22 pages, 31 figures, 1 table