On intrinsically knotted or completely 3-linked graphs

Details On intrinsically knotted or completely 3-linked graphs On intrinsically knotted or completely 3-linked graphs

2010-06-03

arxiv.org/abs/1006.0698v4

Mathematics

Geometric Topology

17 pages, 9 figures

Scientific paper

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of $\triangle Y$-exchanges and $Y \triangle$-exchanges is a minor-minimal intrinsically knotted or completely 3-linked graph.

Affiliated with

Also associated with

No associations

Rating

On intrinsically knotted or completely 3-linked graphs 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 On intrinsically knotted or completely 3-linked graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On intrinsically knotted or completely 3-linked graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514202