K_6 minors in large 6-connected graphs
Combinatorics
2012-03-13 v1 Discrete Mathematics
Abstract
Jorgensen conjectured that every 6-connected graph with no K_6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.
Cite
@article{arxiv.1203.2192,
title = {K_6 minors in large 6-connected graphs},
author = {Ken-ichi Kawarabayashi and Serguei Norine and Robin Thomas and Paul Wollan},
journal= {arXiv preprint arXiv:1203.2192},
year = {2012}
}
Comments
47 pages, 11 figures