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

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

Elena Pavelescu, Ramin Naimi, 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 graphsintrinsically linked graphintrinsically knotted graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Unnamed Item
• Sachs' linkless embedding conjecture
• TRIANGLE-Y EXCHANGES ON INTRINSIC KNOTTING OF ALMOST COMPLETE AND COMPLETE PARTITE GRAPHS
• A newly recognized intrinsically knotted graph

This page was built for publication: Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph