A grid theorem for strong immersions of walls

A grid theorem for strong immersions of walls

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Diestel, Reinhard, Jacobs, Raphael W, Knappe, Paul, Wollan, Paul
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.2301.05134