The Exact End-Degree Threshold for Finite-Width Directed Hexagonal Grids
Grid theorems provide a fundamental link between the structure of ends and the existence of grid-like subgraphs in infinite graphs and digraphs. For every fixed width $n$, let $k(n)$ denote the least positive integer such that every digraph with an end of in-degree at least $k(n)$ contains a subdivision of the directed...