English

Halin's grid theorem for digraphs

Combinatorics 2025-06-17 v2

Abstract

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 R\mathcal{R} of disjoint equivalent out-rays there is a grid whose vertical rays are contained in R\mathcal{R}. Furthermore, we obtain similar results for in-rays and necklaces.

Keywords

Cite

@article{arxiv.2412.03482,
  title  = {Halin's grid theorem for digraphs},
  author = {Florian Reich},
  journal= {arXiv preprint arXiv:2412.03482},
  year   = {2025}
}

Comments

19 pages, 5 figures

R2 v1 2026-06-28T20:23:11.694Z