K_6 minors in large 6-connected graphs

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.

47 pages, 11 figures