|
Organizers |
Minors in Large Highly-Connected Graphs
by
John Maharry
The Ohio State University
Coauthors: Ken-ichi Kawarabayashi
Using ideas from Robertson and Seymour’s Graph Minors series, there have been a number of recent results roughly stating that sufficiently large highly-connected graphs must contain certain graphs as minors. This talk will be a survey of these results, including our recent result that sufficiently large non-planar 5-connected graphs must contain both K3, 4 and K6-Edge as minors.
Date received: April 18, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-48.