Genghua Fan, Yanmei Hong, Qinghai Liu
Published 2018-04-18Version 1
The Erd\"os-S\'os conjecture states that if $G$ is a graph with average degree more than $k-1$, then G contains every tree of $k$ 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.
A lower bound of the energy of non-singular graphs in terms of average degree
Average Degree in Graph Powers
Average Degree of Graphs Derived From Aperiodic Tilings
![QR code for arXiv:1804.06567 [math.CO]](http://oss.arxitics.com/images/favicon.svg)