Indexed by：
Abstract：
The Erdos-Sos Conjecture states that if G is a graph with average degree more than k - 1, then G contains every tree with k edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that if G is a graph on n vertices with average degree more than k - 1, then G contains every spider with k edges, where k ＞= n+5/2. (C) 2013 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE MATHEMATICS
ISSN： 0012-365X
Year： 2013
Issue： 22
Volume： 313
Page： 2513-2517
0 . 5 6 6
JCR@2013
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 8
SCOPUS Cited Count： 9
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
