Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647379 | Discrete Mathematics | 2013 | 5 Pages |
Abstract
The Erdős–Sós Conjecture states that if GG is a graph with average degree more than k−1k−1, then GG contains every tree with kk edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that if GG is a graph on nn vertices with average degree more than k−1k−1, then GG contains every spider with kk edges, where k≥n+52.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Genghua Fan,