Counting Links and Knots in Complete Graphs - Mathematics > Geometric TopologyReportar como inadecuado




Counting Links and Knots in Complete Graphs - Mathematics > Geometric Topology - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We investigate the minimal number of links and knots in complete partitegraphs. We provide exact values or bounds on the minimal number of links forall complete partite graphs with all but 4 vertices in one partition, or with 9vertices 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 numberof knots for all complete partite graphs with 8 vertices.



Autor: Loren Abrams, Blake Mellor, Lowell Trott

Fuente: https://arxiv.org/







Documentos relacionados