Metraipolis › archive › dc_eb4da79d364e
The Exact End-Degree Threshold for Finite-Width Directed Hexagonal Grids — arXiv:2608.21650
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21650
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:29:50.640Z
- SHA-256 of the archived text
ab8fdb16b0973b2d527be91ef9695ddc5d47f8299113630185b9f64ac6bbe887- Stable URL of this page
https://metraipolis.com/documento/dc_eb4da79d364e
How to cite
The Exact End-Degree Threshold for Finite-Width Directed Hexagonal Grids — arXiv:2608.21650 — arXiv (en), https://arxiv.org/abs/2608.21650 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eb4da79d364e (Metraipolis archive dc_eb4da79d364e, sha256 ab8fdb16b0973b2d527be91ef9695ddc5d47f8299113630185b9f64ac6bbe887)
BibTeX
@misc{dceb4da79d364e,
title = {The Exact End-Degree Threshold for Finite-Width Directed Hexagonal Grids — arXiv:2608.21650},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21650},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eb4da79d364e; sha256 ab8fdb16b0973b2d527be91ef9695ddc5d47f8299113630185b9f64ac6bbe887},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21650. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 hexagonal grid of width $n$. Hamann and Heuer asked the exact vaule of $k(n)$. We solve this problem by proving that $$ k(n)=\left\lfloor\frac{3n}{2}\right\rfloor-1 \qquad\text{for every }n\geq4, $$ while $k(1)=1$, $k(2)=2$, and $k(3)=4$. For the upper bound, we establish a finite vacancy theorem for labelled token slides, convert it into a closed directed schedule on an auxiliary ray digraph, and lift the schedule through fresh clean linkages. For the matching lower bound, we use alternating orientations of products of a ray with a three-armed tree and prove a no-passing property for disjoint directed paths. We also determine the dual extremal parameter. Let $W(d)$ denote the largest width that is always forced by an end of in-degree $d$, with all branch rays remaining in that end, then $$W(d)=\left\lfloor\frac{2d}{3}\right\rfloor+1 \qquad\text{for every }d\geq4,$$ with $W(1)=1$ and $W(2)=W(3)=2$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.21650 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.385Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).