INTRINSICALLY n-LINKED GRAPHS

@inproceedings{Flapan2001INTRINSICALLYNG,
  title={INTRINSICALLY n-LINKED GRAPHS},
  author={Erica Flapan and James Pommersheim and Joel Foisy and Ramin Naimi},
  year={2001}
}
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.