Unavoidable Minors of Large 5-Connected Graphs
Loading...
Date
2016-08-24
Authors
Shantanam, Abhinav
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
Abstract
This thesis shows that, for every positive integer $n \geq 5$, there exists a positive integer $N$ such that every $5-$connected graph with at least $N$ vertices has a minor isomorphic to one of thirty explicitly defined $5-$connected graphs $H_1(n), ..., H_{30}(n)$, each with at least $n$ vertices.
Description
Keywords
unavoidable minors, 5-connected