On graphs for which every planar immersion lifts to a knotted spatial embedding

DOI10.2140/INVOLVE.2008.1.145MaRDI QIDQ940979zbMATH OpenOpenAlexFDO

Authors Joel Foisy, Chad Versace, Alice Wilson, Amy T. DeCelles

Publication date 4 September 2008

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2008.1.145

zbMATH Keywords

spatial graphsintrinsically linkedintrinsically knottedvertex expansionintrinsically knottableintrinsically linkable

Mathematics Subject Classification ID

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

Recommendations

• Intrinsic knotting and linking of almost complete graphs
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• More intrinsically knotted graphs
• Intrinsically linked graphs and even linking number

Cited in

(6)

• Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot
• On strongly almost trivial embeddings of graphs
• Planar graphs having no proper 2-immersions in the plane. II
• More intrinsically knotted graphs
• Plane curves in an immersed graph in \({\mathbb R}^{2}\)
• Crossing numbers and rotation numbers of cycles in a plane immersed graph

This page was built for publication: On graphs for which every planar immersion lifts to a knotted spatial embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940979)