Intrinsically n-Linked Graphs

Authors

Erica Flapan, Pomona CollegeFollow
James Pommersheim, Pomona CollegeFollow
Joel Foisy, SUNY Potsdam
Ramin Naimi, Occidental College

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 ℝ³ 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 ℝ³ 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.

DOI

10.1142/S0218216501001360

Recommended Citation

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