Title

Intrinsically n-Linked Graphs

Document Type

Article

Department

Mathematics (Pomona)

Publication Date

2001

Keywords

Intrinsically linked, Self-linked, Embedded graphs, Spatial graphs, Spatial embeddings, Minor minimal

Abstract

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.

Rights Information

© 2001 World Scientific Publishing Co.

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.