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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Infinite grids in digraphs

Matthias Hamann, Karl Heuer
European Journal of Combinatorics
Computational Geometry and Mesh Generation
article

Infinite grids in digraphs

Matthias Hamann, Karl Heuer
article en

Abstract

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.

European Journal of CombinatoricsVol. 135
Universität Hamburg (DE), Technical University of Denmark (DK)
Openalex Percentile: Top 25%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.