K_6 minors in large 6-connected graphs
  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. 
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas and Paul Wollan
math.CO cs.DM