Download this article
 Download this article For screen
For printing
Recent Issues

Volume 26
Issue 5, 1597–1963
Issue 4, 1229–1596
Issue 3, 825–1227
Issue 2, 411–824
Issue 1, 1–410

Volume 25, 9 issues

Volume 24, 9 issues

Volume 23, 9 issues

Volume 22, 8 issues

Volume 21, 7 issues

Volume 20, 7 issues

Volume 19, 7 issues

Volume 18, 7 issues

Volume 17, 6 issues

Volume 16, 6 issues

Volume 15, 6 issues

Volume 14, 6 issues

Volume 13, 6 issues

Volume 12, 4 issues

Volume 11, 5 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 4 issues

Volume 7, 4 issues

Volume 6, 5 issues

Volume 5, 4 issues

Volume 4, 2 issues

Volume 3, 2 issues

Volume 2, 2 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
 
Subscriptions
 
ISSN (electronic): 1472-2739
ISSN (print): 1472-2747
 
Author index
To appear
 
Other MSP journals
A structural approach to tree decompositions of knots and spatial graphs

Corentin Lunel and Arnaud de Mesmay

Algebraic & Geometric Topology 26 (2026) 2015–2047
DOI: 10.2140/agt.2026.26.2015
Abstract

Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. The treewidth of a graph is a parameter quantifying how close a graph is to a tree. When a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants and properties of the knot. It was recently proved that there exist knots which do not admit any diagram of low treewidth, and the proof relied on intricate low-dimensional topology techniques. In this work, we initiate a thorough investigation of tree decompositions of knot diagrams (or more generally, diagrams of spatial graphs) using ideas from structural graph theory. We define an obstruction on spatial embeddings that forbids low treewidth diagrams, and we prove that it is optimal with respect to a related width invariant. We then show the existence of this obstruction for knots of high representativity, which include, for example, torus knots, providing a new and self-contained proof that those do not admit diagrams of low treewidth. This last step is inspired by a result of Pardon on knot distortion.

Keywords
knots, spatial graphs, tree decompositions, tangles, representativity
Mathematical Subject Classification
Primary: 05C10
Secondary: 57K10, 57M15
References
Publication
Received: 21 December 2023
Revised: 18 December 2024
Accepted: 26 May 2025
Published: 22 June 2026
Authors
Corentin Lunel
Inria Université Côte d’Azur
Sophia Antipolis
France
Arnaud de Mesmay
LIGM, CNRS
Université Gustave Eiffel
Marne la Vallée
France

Open Access made possible by participating institutions via Subscribe to Open.