Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$
Geometric Topology
2020-05-19 v4
Abstract
We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph in terms of the square of the linking number and the second coefficient of the Conway polynomial. As an application, we show that every rectilinear spatial contains a nontrivial Hamiltonian knot.
Keywords
Cite
@article{arxiv.1211.4131,
title = {Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$},
author = {Hiroka Hashimoto and Ryo Nikkuni},
journal= {arXiv preprint arXiv:1211.4131},
year = {2020}
}
Comments
21 pages, 11 figures