89 citations · 484 across the 68 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
Rooted grid minors
Dániel Marx, Paul Seymour, Paul Wollan
Intuitively, a tangle of large order in a graph is a highly-connected part of the graph, and it is known that if a graph has a tangle of large order then it has a large grid minor.…
math.CO2013
Immersions in highly edge connected graphs
Daniel Marx, Paul Wollan
We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then…