A structural approach to tree decompositions of knots and spatial graphs

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.