Recognition: unknown
K₆ minors in large 6-connected graphs
classification
🧮 math.CO
cs.DM
keywords
connectedgraphgraphslargeconjectureconjectureddeletionevery
read the original 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.
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.