- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- The Kelmans-Seymour conjecture
Open Collections
BIRS Workshop Lecture Videos
Featured Collection
BIRS Workshop Lecture Videos
The Kelmans-Seymour conjecture Yu, Xingxing
Description
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 Metadata
Title |
The Kelmans-Seymour conjecture
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2017-08-23T09:01
|
Description |
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.
|
Extent |
60 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Georgia Institute of Technology
|
Series | |
Date Available |
2018-04-11
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0365326
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International