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

DOI10.1142/S0218216514500758zbMath1309.05055arXiv1407.0297MaRDI QIDQ5244578

Ramin Naimi, Elena Pavelescu, Hannah R. Schwartz

Publication date: 27 March 2015

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.0297

zbMATH Keywords

spatial graphs; intrinsically linked graph; intrinsically knotted graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

57M15: Relations of low-dimensional topology with graph theory