| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777662 | Journal of Combinatorial Theory, Series B | 2017 | 10 Pages |
Abstract
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. Here we show that for any k, if G has a tangle of large order and Z is a set of vertices of cardinality k that cannot be separated from the tangle by any separation of order less than k, then G has a large grid minor containing Z, in which the members of Z all belong to the outside of the grid.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daniel Marx, Paul Seymour, Paul Wollan,