paper

The Kelmans-Seymour conjecture III: 3-vertices in

arXiv:1609.05747

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.