A Gap in Stanfield's Proof of Sachs' Linear Linkless Embedding Conjecture
Abstract
This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs' conjecture that every linklessly embeddable graph has a linear linkless embedding in R3.
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.