Intrinsically n-Linked Graphs
Intrinsically linked, Self-linked, Embedded graphs, Spatial graphs, Spatial embeddings, Minor minimal
For every natural number n, we exhibit a graph with the property that every embedding of it in ℝ3 contains a non-split n-component link. Furthermore, we prove that our graph is minor minimal in the sense that every minor of it has an embedding in ℝ3 that contains no non-split n-component link.
© 2001 World Scientific Publishing Co.
E. Flapan, J. Foisy, R. Naimi, J. Pommersheim, Intrinsically n-linked Graphs, Journal of Knot Theory and its Ramifications, Vol. 10, (2001) 1143-1154. doi: 10.1142/S0218216501001360