A grid theorem for strong immersions of walls
arXiv:2301.05134
Abstract
We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small `width', which is measured in terms of its adhesion and the path-likeness of its torsos.
16 pages, corrected indices in Lemma 3.1, minor changes compared to previous version