Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.