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

intrinsically knottableintrinsically knottedintrinsically linkableintrinsically linkedspatial graphsvertex expansion

Mathematics Subject Classification ID

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

Review text

A graph is intrinsically linked (respectively knotted) if, for every planar immersion of the graph, \textit{every} assignment of a crossing structure results in a diagram for a spatial graph that contains a pair of linked cycles (respectively a knotted cycle). A graph is intrinsically linkable (respectively knottable) if, for every planar immersion of the graph, there exists \textit{an} assignment of a crossing structure that results in a diagram for a spatial graph that contains a pair of linked cycles (respectively a knotted cycle). This paper is largely concerned with the distinction between intrinsically linkable (respectively knottable) and intrinsically linked (respectively knotted) graphs. In this paper the authors provide examples of intrinsically linkable graphs that are not intrinsically linked and examples of intrinsically knottable graphs that are not intrinsically knotted. These examples show that although an intrinsically linked (respectively knotted) graph is necessarily intrinsically linkable (respectively knottable), the converse is not true. Examples are also given to show that the property of a graph being intrinsically linkable (respectively knottable) is not preserved by vertex expansion.

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)

• Planar graphs having no proper 2-immersions in the plane. II
• On strongly almost trivial embeddings of graphs
• More intrinsically knotted graphs
• Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot
• 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)