- Series
- Graph Theory Seminar
- Time
- Wednesday, April 6, 2016 - 3:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Yan Wang – Math, GT
- Organizer
- 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 prove a lemma using the characterization of
three paths with designated ends, which will be used in the proof of the
Kelmans-Seymour conjecture.