Title:
The Extremal Function for K10 Minors

Thumbnail Image
Author(s)
Zhu, Dantong
Authors
Advisor(s)
Yu, Xingxing
Advisor(s)
Person
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Supplementary to
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.
Sponsor
Date Issued
2021-12-15
Extent
Resource Type
Text
Resource Subtype
Dissertation
Rights Statement
Rights URI