2000 character limit reached
Toroidal Embeddings of non-Intrinsically-Linked Graphs
Published 18 Nov 2024 in math.GT | (2411.12041v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.