Intrinsically Linked Graphs with Knotted Components

Details Intrinsically Linked Graphs with Knotted Components Intrinsically Linked Graphs with Knotted Components

2007-05-15

arxiv.org/abs/0705.2026v1

Mathematics

Geometric Topology

8 pages, 5 figures

Scientific paper

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nontrivial knots. We then turn our attention to complete graphs and show that for any given n, every embedding of a large enough complete graph contains a two component link whose linking number is a nonzero multiple of n.

Affiliated with

Also associated with

No associations

Rating

Intrinsically Linked Graphs with Knotted Components does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intrinsically Linked Graphs with Knotted Components, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsically Linked Graphs with Knotted Components will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622526