Toroidal Embeddings of non-Intrinsically-Linked Graphs
Geometric Topology
2024-11-20 v1
Abstract
If a graph can be embedded on the torus, and be embedded linklessly in , it's not known whether or not we can always find a linkless embedding of contained in the standard (unknotted) torus; We show that, for orders 9 and below, any graph which is both embeddable on the torus, and linklessly in , can be embedded linklessly in the standard torus.
Keywords
Cite
@article{arxiv.2411.12041,
title = {Toroidal Embeddings of non-Intrinsically-Linked Graphs},
author = {Nathan Hall},
journal= {arXiv preprint arXiv:2411.12041},
year = {2024}
}