Metraipolis › archive › dc_f7bd97abbc9e

Potatoes and Onions — arXiv:2610.20391

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20391
License (as archived)
CC0-1.0
Archived
2026-10-15T21:52:49.010Z
SHA-256 of the archived text
e3ba2657569cab261cd1c22d316c890c78db70531696893a29556977c58f0c91
Stable URL of this page
https://metraipolis.com/documento/dc_f7bd97abbc9e

How to cite

Potatoes and Onions — arXiv:2610.20391 — arXiv (en), https://arxiv.org/abs/2610.20391 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f7bd97abbc9e (Metraipolis archive dc_f7bd97abbc9e, sha256 e3ba2657569cab261cd1c22d316c890c78db70531696893a29556977c58f0c91)
BibTeX
@misc{dcf7bd97abbc9e,
  title = {Potatoes and Onions — arXiv:2610.20391},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20391},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f7bd97abbc9e; sha256 e3ba2657569cab261cd1c22d316c890c78db70531696893a29556977c58f0c91},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20391. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The first major step in the theory of graph minors of Robertson and Seymour was the grid theorem, a fundamental duality result describing that any graph of sufficiently high treewidth must contain a large grid as a minor. Since this pioneering work, multiple grid theorems have been established in structural graph theory, linking various width parameters of combinatorial objects with the non-existence of grid-like obstructions. In particular, Kawarabayashi and Kreutzer [STOC'15] proved a variant of the grid theorem for directed graphs that links directed treewidth with the non-existence of topological minors of large cylindrical walls. On the other hand, to study immersions of undirected graphs $-$ another containment relation that focuses on edge-disjointness, rather than vertex-disjointness $-$ Wollan [JCTB'15] introduced a parameter, tree-cutwidth, and proved that it is dual to immersions of large walls. In this work, we present a version of Wollan's parameter for directed graphs, the directed tree-cutwidth. The main result is a grid theorem for directed tree-cutwidth, establishing that it is dual to directed immersions of large cylindrical walls.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2610.20391 — 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-15T21:37:14.441Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).