arXiv (All)
open access
Polynomial directed treewidth forces a large bramble with congestion two
Brambles of constant congestion in directed graphs have interesting structural and algorithmic applications, and it is desirable to find the smallest function $f_c(k)$ such that if a digraph has directed treewidth at least $f_c(k)$, then it contains a bramble of size at least $k$ and congestion at m
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter#1357665
- On minimal regular graphs with given constraintsm#1041667
- Parameterized complexity of $k$-Coloring in graphs with no long induced paths#1069883
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Tight paths in fully directed hypergraphs#821761
Record · ID 1297622
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive