2000 character limit reached
Halin's grid theorem for digraphs (2412.03482v2)
Published 4 Dec 2024 in math.CO
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 $\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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.