arXiv · 2611.12172
A Rooted Structure Theorem for $5$-Connected Graphs and $K_6^-$-Minors
Abstract
Jorgensen conjectured that every $6$-connected graph with no $K_6$-minor is apex. For a $6$-connected graph containing a $K_4$ on vertices $a_1,\dots,a_4$, being apex is equivalent to $G-a_i$ having a planar embedding with the other three roots on a common face for some $i$, so that for such graphs the conjecture becomes a rooted planarity statement. Robertson, Seymour, and Thomas showed that the failure of the corresponding three-rooted planarity is witnessed by a legless tripod. We introduce a four-root structure, called a frame, that extends this certificate, and prove a structural theorem: every $5$-connected graph containing a frame rooted at four prescribed vertices contains a subgraph of one of five explicit types, denoted $A$--$E$. This theorem does not depend on the edges among the roots. As an application, we show that when the four roots span a $K_4^-$, each of the five configurations yields a $K_6^-$-minor. Together with a planar argument for the case without a frame and an induction based on a theorem of Kawarabayashi, this gives a proof that every non-planar $5$-connected graph contains a $K_6^-$-minor. This statement also follows from a recent theorem of Lo; our proof is independent and is driven by the rooted structure theorem, whose method we expect to apply to Jorgensen's conjecture with other target configurations.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ken-ichi Kawarabayashi, Alexandre Simon. 2026-11-09. A Rooted Structure Theorem for $5$-Connected Graphs and $K_6^-$-Minors. https://searcharxiv.com/abs/2611.12172
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.