| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656685 | Journal of Combinatorial Theory, Series B | 2016 | 11 Pages |
Abstract
Fix g>1g>1. Every graph of large enough tree-width contains a g×gg×g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g×gg×g grid as an immersion (and hence contains any fixed graph with maximum degree at most four as an immersion). This result has a number of applications.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Chudnovsky, Zdeněk Dvořák, Tereza Klimošová, Paul Seymour,