Papers › Toroidal Embeddings of non-Intrinsically-Linked Graphs
Toroidal Embeddings of non-Intrinsically-Linked Graphs
Nathan Hall
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
If a graph G 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 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 ℝ³, can be embedded linklessly in the standard torus.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections