Intrinsic knotting and linking of almost complete partite graphs

Details Intrinsic knotting and linking of almost complete partite graphs Intrinsic knotting and linking of almost complete partite graphs

2003-12-09

arxiv.org/abs/math/0312176v2

Mathematics

Geometric Topology

v2: 20 pages, 10 figures, substantial expansion of version 1

Scientific paper

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph.

Affiliated with

Also associated with

No associations

Rating

Intrinsic knotting and linking of almost complete partite 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 Intrinsic knotting and linking of almost complete partite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsic knotting and linking of almost complete partite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41472