arXiv · 1008.1085
Counting Links and Knots in Complete Graphs
Abstract
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.
Explore related subjects
Keep this discovery
Loren Abrams, Blake Mellor, Lowell Trott. 2010-08-05. Counting Links and Knots in Complete Graphs. https://arxiv.org/abs/1008.1085
Cite the original work for its findings. Save a collection to share your selection of sources.