The Erd\"os-S\'os Conjecture for Spiders
Combinatorics
2019-12-02 v2
Abstract
The Erd\"os-S\'os conjecture states that if is a graph with average degree more than , then G contains every tree of edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that Erd\"os-S\'os conjecture holds for all spiders.
Keywords
Cite
@article{arxiv.1804.06567,
title = {The Erd\"os-S\'os Conjecture for Spiders},
author = {Genghua Fan and Yanmei Hong and Qinghai Liu},
journal= {arXiv preprint arXiv:1804.06567},
year = {2019}
}
Comments
17 pages