30 citations · 158 across the 36 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021★ 3 cited
Constant congestion brambles in directed graphs
Tomáš Masařík, Marcin Pilipczuk, Paweł Rzążewski +1
The Directed Grid Theorem, stating that there is a function such that a directed graphs of directed treewidth at least contains a directed grid of size at least as a…
math.CO2020★ 7 cited
Constant Congestion Brambles
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk +1
A bramble in an undirected graph is a family of connected subgraphs of such that for every two subgraphs and in the bramble either $V(H_1) \cap V(H_2) \neq \emp…