A full Halin grid theorem
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914709074083840 |
|---|---|
| author | Georgakopoulos, Agelos Hamann, Matthias |
| author_facet | Georgakopoulos, Agelos Hamann, Matthias |
| contents | Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05862 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A full Halin grid theorem Georgakopoulos, Agelos Hamann, Matthias Combinatorics Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid. |
| title | A full Halin grid theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.05862 |