|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
Linear linkless
embeddings: proof of a conjecture by Sachs
Lynn Stanfield |
|
Algebraic & Geometric Topology 25 (2025) 4585–4598
|
 |
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. |
Keywords
graphs, topology, Sachs, linear embeddings, graph
embeddings, linkless, flat
|
Mathematical Subject Classification
Primary: 05C10
|
References |
Publication
Received: 1 July 2022
Revised: 24 March 2024
Accepted: 5 June 2024
Published: 20 November 2025
|
Authors |
| Lynn Stanfield | |
| Department of Mathematics and
Statistics University of Nevada, Reno Reno, NV United States |
|
| © 2025 The Author(s), under exclusive license to MSP (Mathematical Sciences Publishers). Distributed under the Creative Commons Attribution License 4.0 (CC BY). |
Open Access made possible by participating institutions via Subscribe to Open.
