2012/03/09 by Kawarabayashi, Ken-ichi, Norine, Serguei, Thomas, Robin +1
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1203.2171
We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K6 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.