paper

Halin's grid theorem for digraphs

arXiv:2412.03482

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

19 pages, 5 figures

Halin's grid theorem for digraphs · wovepaper