Intrinsic knotting and linking of almost complete graphs

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

2007-01-15

arxiv.org/abs/math/0701422v1

Mathematics

Geometric Topology

16 pages, 4 figures

Scientific paper

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also 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.

Affiliated with

Also associated with

No associations

Rating

Intrinsic knotting and linking of almost complete 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 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 graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585400