Recognition: unknown
K₆ minors in 6-connected graphs of bounded tree-width
classification
🧮 math.CO
cs.DM
keywords
connectedgraphsboundedgraphholdssufficientlytree-widthconclusion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.