Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2509.09035 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911152508764160 |
|---|---|
| author | Nguyen, Tung Scott, Alex Seymour, Paul |
| author_facet | Nguyen, Tung Scott, Alex Seymour, Paul |
| contents | Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every finite graph $G$ with an $H$ minor has path-width more than $k$. If we (twice) replace ``path-width'' by ``line-width'', the same is true for infinite graphs $G$.
We prove a ``coarse graph theory'' analogue, as follows. For every finite tree $H$ and every $c$, there exist $k,L,C$ such that every graph that does not contain $H$ as a $c$-fat minor admits an $(L,C)$-quasi-isonetry to a graph with line-width at most $k$; and conversely, for all $k,L,C$ there exist $c$ and a finite tree $H$ such that every graph that contains $H$ as a $c$-fat minor admits no $(L,C)$-quasi-isometry to a graph with line-width at most $k$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_09035 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Asymptotic structure. III. Excluding a fat tree Nguyen, Tung Scott, Alex Seymour, Paul Combinatorics Metric Geometry 05C12, 05C83, 51F30 Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every finite graph $G$ with an $H$ minor has path-width more than $k$. If we (twice) replace ``path-width'' by ``line-width'', the same is true for infinite graphs $G$. We prove a ``coarse graph theory'' analogue, as follows. For every finite tree $H$ and every $c$, there exist $k,L,C$ such that every graph that does not contain $H$ as a $c$-fat minor admits an $(L,C)$-quasi-isonetry to a graph with line-width at most $k$; and conversely, for all $k,L,C$ there exist $c$ and a finite tree $H$ such that every graph that contains $H$ as a $c$-fat minor admits no $(L,C)$-quasi-isometry to a graph with line-width at most $k$. |
| title | Asymptotic structure. III. Excluding a fat tree |
| topic | Combinatorics Metric Geometry 05C12, 05C83, 51F30 |
| url | https://arxiv.org/abs/2509.09035 |