The Kelmans-Seymour conjecture III: 3-vertices in K4-

Abstract

Let G be a 5-connected nonplanar graph and let x1,x2,y1,y2∈ V(G) be distinct, such that G[\x1,x2,y1,y2\] K4- and y1y2 E(G). We show that one of the following holds: G-x1 contains K4-, or G contains a K4- in which x1 is of degree 2, or G contains a TK5 in which x1 is not a branch vertex, or \x2,y1,y2\ may be chosen so that for any distinct z0, z1∈ N(x1)-\x2,y1,y2\, G-\x1v:v \z0, z1,x2, y1,y2\\ contains TK5. This result will be used to prove the Kelmans-Seymour conjecture.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…