Halin's grid theorem for digraphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909649588977664 |
|---|---|
| author | Reich, Florian |
| author_facet | Reich, Florian |
| contents | Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family $\mathcal{R}$ of disjoint equivalent out-rays there is a grid whose vertical rays are contained in $\mathcal{R}$. Furthermore, we obtain similar results for in-rays and necklaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_03482 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Halin's grid theorem for digraphs Reich, Florian Combinatorics 05C63, 05C20 Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family $\mathcal{R}$ of disjoint equivalent out-rays there is a grid whose vertical rays are contained in $\mathcal{R}$. Furthermore, we obtain similar results for in-rays and necklaces. |
| title | Halin's grid theorem for digraphs |
| topic | Combinatorics 05C63, 05C20 |
| url | https://arxiv.org/abs/2412.03482 |