Counting Links and Knots in Complete Graphs

Details Counting Links and Knots in Complete Graphs Counting Links and Knots in Complete Graphs

2010-08-05

arxiv.org/abs/1008.1085v1

Mathematics

Geometric Topology

21 pages, 11 figures

Scientific paper

We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices in total. In particular, we find that the minimal number of links for $K_{4,4,1}$ is 74. We also provide exact values or bounds on the minimal number of knots for all complete partite graphs with 8 vertices.

Affiliated with

Also associated with

No associations

Rating

Counting Links and Knots in 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 Counting Links and Knots in Complete Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Links and Knots in Complete Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230124