Immersion in four-edge-connected graphs
Combinatorics
2013-08-06 v1 Discrete Mathematics
Abstract
Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x 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.
Keywords
Cite
@article{arxiv.1308.0827,
title = {Immersion in four-edge-connected graphs},
author = {Maria Chudnovsky and Zdeněk Dvořák and Tereza Klimošová and Paul Seymour},
journal= {arXiv preprint arXiv:1308.0827},
year = {2013}
}
Comments
11 pages