Back to search

Georgia Institute of Technology

The Extremal Function for K10 Minors

Abstract

dc:description.abstract

We 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 × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/66169

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Zhu, Dantong. The Extremal Function for K10 Minors. Doctoral thesis, Georgia Institute of Technology, 2021. http://hdl.handle.net/1853/66169