Abstract
dc:description.abstractWe prove that every graph on n >= 8 vertices and at least 8n-35 edges either has a K10 minor or is isomorphic to some graph included in a few families of exceptional graphs.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Mathematics
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Zhu, Dantong
- Advisor dc:contributor.advisor
-
- Yu, Xingxing
- Committee members dc:contributor.committeemember
-
- Bernshteyn, Anton
- Blekherman, Grigoriy
- Song, Zi-Xia
- Wang, Zhiyu
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/66169