Intrinsically knotted graphs with linklessly embeddable simple minors
Geometric Topology
2024-04-24 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.2111.08859,
title = {Intrinsically knotted graphs with linklessly embeddable simple minors},
author = {Thomas W. Mattman and Ramin Naimi and Andrei Pavelescu and Elena Pavelescu},
journal= {arXiv preprint arXiv:2111.08859},
year = {2024}
}
Comments
22 pages, 31 figures, 1 table