The Extremal Function for K10 Minors
Loading...
Author(s)
Zhu, Dantong
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
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
2021-12-15
Extent
Resource Type
Text
Resource Subtype
Dissertation