The Kelmans-Seymour conjecture V: no contractible edges or triangles (finding TK_5)

Graph Theory Seminar
Wednesday, April 13, 2016 - 3:05pm for 1 hour (actually 50 minutes)
Skiles 005
Yan Wang – Math, GT
Robin Thomas
Let G be a 5-connected nonplanar graph. To show the Kelmans-Seymour conjecture, we keep contracting a connected subgraph on a special vertex z until the following happens: H does not contain K_4^-, and for any subgraph T of H such that z is a vertex in T and T is K_2 or K_3, H/T is not 5-connected. In this talk, we study the structure of these 5-separations and 6-separations, and prove the Kelmans-Seymour conjecture.