Infinite grids in digraphs
Halin proved that every graph with an end ω containing infinitely many pairwise disjoint rays admits a subdivision of the infinite quarter-grid as a subgraph where all rays from that subgraph belong to ω . We will prove a corresponding statement for digraphs, that is, we will prove that every digraph that has an end with infinitely many pairwise disjoint directed rays contains a subdivision of a grid-like digraph all of whose directed rays belong to that end.
Authors
- Matthias Hamann (ORCID: https://orcid.org/0009-0007-9455-8580)
- Karl Heuer (ORCID: https://orcid.org/0000-0002-6841-9815)
Institutions
- Universität Hamburg (DE)
- Technical University of Denmark (DK)
Publication Details
- Journal
- European Journal of Combinatorics
- Published
- 2026-03-12
- DOI
- https://doi.org/10.1016/j.ejc.2026.104370
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- article
- Field-Weighted Citation Impact
- 0.00