A grid theorem for strong immersions of walls
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.