Year: 2025
Type: article
Abstract: In 1983, Sachs conjectured that every linklessly embeddable graph has a linear linkless embedding.We prove a stronger statement: every flat embedding of a linkless graph can be linearized.
Source: Algebraic & Geometric Topology
Author: Lynn Stanfield
Institution: University of Nevada, Reno
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4416660131