A grid theorem for strong immersions of walls
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915110913572864 |
|---|---|
| author | Diestel, Reinhard Jacobs, Raphael W. Knappe, Paul Wollan, Paul |
| author_facet | Diestel, Reinhard Jacobs, Raphael W. Knappe, Paul Wollan, Paul |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_05134 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A grid theorem for strong immersions of walls Diestel, Reinhard Jacobs, Raphael W. Knappe, Paul Wollan, Paul Combinatorics 05C75, 05C83, 05C40 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. |
| title | A grid theorem for strong immersions of walls |
| topic | Combinatorics 05C75, 05C83, 05C40 |
| url | https://arxiv.org/abs/2301.05134 |