K_6 minors in 6-connected graphs of bounded tree-width
Combinatorics
2013-04-09 v2 Discrete Mathematics
Abstract
We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs.
Cite
@article{arxiv.1203.2171,
title = {K_6 minors in 6-connected graphs of bounded tree-width},
author = {Ken-ichi Kawarabayashi and Serguei Norine and Robin Thomas and Paul Wollan},
journal= {arXiv preprint arXiv:1203.2171},
year = {2013}
}
Comments
33 pages, 8 figures