Date of Award
2007
Degree Type
Dissertation
Degree Name
Doctor of Philosophy in Mathematics
Department
Mathematics
First Advisor
Nancy Eaton
Abstract
We investigate a tantalizing problem in extremal graph theory known as the Erdős-Sós conjecture. The Erdős-Sós conjecture states that every simple graph with average degree greater than k − 2 contains every tree on k vertices as a subgraph (k is a positive integer). We prove various special cases each of which places certain restrictions on the class of graphs or the class of trees considered. In our descriptions below, G is a simple graph (that is, no loops and no multi-edges) on n vertices that has average degree greater than k − 2; and that T is any tree on k vertices. In 1989, Sidorenko proved the conjecture holds if T has a vertex v with at least [special characters omitted] − 1 leaf neighbors. In the first manuscript we improve upon this result by proving it is sufficient to assume that T has a vertex v with at least [special characters omitted] − 2 leaf neighbors. We use this to prove the conjecture holds if the graph has minimum degree k − 4. From this result, we obtain that the conjecture holds for all k ≤ 8. A spider of degree d is a tree that can be thought of as the union of d edge-disjoint paths that share exactly one common end-vertex. In the second manuscript, we prove that G contains every spider of degree d where d = 3 or d > [special characters omitted] − 2. In the third manuscript, we prove the conjecture holds if G has at most k + 3 vertices. In the fourth manuscript, we prove the conjecture holds if G is Pk+4-free, that is, if G contains no path on k + 4 vertices.
Recommended Citation
Tiner, Gary F., "On the Erdos-Sós conjecture" (2007). Open Access Dissertations. Paper 2182.
https://digitalcommons.uri.edu/oa_diss/2182
Terms of Use
All rights reserved under copyright.
Comments
This dissertation was scanned from microfilm. To report any image quality issues, please contact the URI library at digitalcommons-group@uri.edu as we may be able to fix the problem. The copyright in this dissertation belongs to the author.