The Kelmans-Seymour conjecture III: 3-vertices in $K_4^-$
Dawei He, Yan Wang, Xingxing Yu

TL;DR
This paper investigates the structure of 5-connected nonplanar graphs containing a specific subgraph, providing conditions under which certain minors or subgraphs must exist, advancing the proof of the Kelmans-Seymour conjecture.
Contribution
It establishes new structural conditions involving $K_4^-$ subgraphs in 5-connected nonplanar graphs, aiding in the proof of the Kelmans-Seymour conjecture.
Findings
Either $G-x_1$ contains $K_4^-$ or $G$ contains a $K_4^-$ with degree 2 at $x_1$
$G$ contains a $TK_5$ with $x_1$ not as a branch vertex
A specific configuration of vertices ensures $G$ contains a $TK_5$ after certain deletions
Abstract
Let be a 5-connected nonplanar graph and let be distinct, such that and . We show that one of the following holds: contains , or contains a in which is of degree 2, or contains a in which is not a branch vertex, or may be chosen so that for any distinct , contains . This result will be used to prove the Kelmans-Seymour conjecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Limits and Structures in Graph Theory
