Back to search

University of Waterloo

Unavoidable Minors of Large 5-Connected Graphs

Abstract

dc:description.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 H1(n), ..., H30(n), each with at least $n$ vertices.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shantanam, Abhinav
Advisor dc:contributor.advisor
  • Geelen, Jim

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/10682

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Shantanam, Abhinav. Unavoidable Minors of Large 5-Connected Graphs. University of Waterloo, 2016. http://hdl.handle.net/10012/10682