Toroidal Embeddings of non-Intrinsically-Linked Graphs

Abstract

If a graph G can be embedded on the torus, and be embedded linklessly in R3, 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 R3, can be embedded linklessly in the standard torus.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…