Constant Congestion Brambles in Directed Graphs
From MaRDI portal
Publication:5071097
DOI10.1137/21M1417661zbMath1486.05119arXiv2103.08445OpenAlexW4226142479MaRDI QIDQ5071097
Tomáš Masařík, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge
Publication date: 20 April 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08445
Cites Work
- Polynomial treewidth forces a large grid-like-minor
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors. V. Excluding a planar graph
- Graph searching and a min-max theorem for tree-width
- Directed tree-width
- Towards tight(er) bounds for the excluded grid theorem
- On tree width, bramble size, and expansion
- The Directed Grid Theorem
- An extremal function for contractions of graphs
- Multicommodity flow, well-linked terminals, and routing problems
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
- Half-integral linkages in highly connected directed graphs
- Polynomial Planar Directed Grid Theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Large-treewidth graph decompositions and applications
This page was built for publication: Constant Congestion Brambles in Directed Graphs
