BIRS Workshop Lecture Videos
The Kelmans-Seymour conjecture Yu, Xingxing
Seymour and, independently, Kelmans conjectured that every 5-connected non-planar graph contains a subdivision of $K_5$. We have recently proved this conjecture. I will give a sketch of our proof, and mention several related problems. Joint work with D. He and Y. Wang.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International