Geodesic
On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
Ars mathematica contemporanea, Volume 13 (2017) no. 1, pp. 49-61

See the original article notice from the Ars Mathematica Contemporanea website source

The Erdős-Sós Conjecture states that if G is a simple graph of order n with average degree more than k − 2,  then G contains every tree of order k. In this paper, we prove that Erds-Sós Conjecture is true for n = k + 4.
DOI: 10.26493/1855-3974.905.cb4
Keywords: Erdős-Sós Conjecture, Conjecture, tree, maximum degree 
Long-Tu Yuan; Xiao-Dong Zhang. On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices. Ars mathematica contemporanea, Volume 13 (2017) no. 1, pp. 49-61. doi: 10.26493/1855-3974.905.cb4
@article{10_26493_1855_3974_905_cb4,
     author = {Long-Tu Yuan and Xiao-Dong Zhang},
     title = {
		{On} the {Erd\H{o}s-S\'os} {Conjecture} for graphs on n = k + 4 vertices
	},
     journal = {Ars mathematica contemporanea},
     pages = {49--61},
     year = {2017},
     volume = {13},
     number = {1},
     doi = {10.26493/1855-3974.905.cb4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.905.cb4/}
}
TY  - JOUR
AU  - Long-Tu Yuan
AU  - Xiao-Dong Zhang
TI  - On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
	
JO  - Ars mathematica contemporanea
PY  - 2017
SP  - 49
EP  - 61
VL  - 13
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.905.cb4/
DO  - 10.26493/1855-3974.905.cb4
LA  - en
ID  - 10_26493_1855_3974_905_cb4
ER  - 
%0 Journal Article
%A Long-Tu Yuan
%A Xiao-Dong Zhang
%T On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
	
%J Ars mathematica contemporanea
%D 2017
%P 49-61
%V 13
%N 1
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.905.cb4/
%R 10.26493/1855-3974.905.cb4
%G en
%F 10_26493_1855_3974_905_cb4

Cited by Sources: