Unavoidable Minors of Large 5-Connected Graphs
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.
Collections
Cite this version of the work
Abhinav Shantanam
(2016).
Unavoidable Minors of Large 5-Connected Graphs. UWSpace.
http://hdl.handle.net/10012/10682
Other formats