20 citations · 118 across the 29 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
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…
math.CO2013★ 4 cited
The structure of graphs not admitting a fixed immersion
Paul Wollan
We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions ba…