arXiv · 2411.12041
Toroidal Embeddings of non-Intrinsically-Linked Graphs
Abstract
If a graph $G$ can be embedded on the torus, and be embedded linklessly in $\mathbb{R}^3$, it's not known whether or not we can always find a linkless embedding of $G$ 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 $\mathbb{R}^3$, can be embedded linklessly in the standard torus.
Explore related subjects
Keep this discovery
Nathan Hall. 2024-11-18. Toroidal Embeddings of non-Intrinsically-Linked Graphs. https://arxiv.org/abs/2411.12041
Cite the original work for its findings. Save a collection to share your selection of sources.