On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
Long‐Tu Yuan, Xiao‐Dong Zhang · Ars Mathematica Contemporanea · 2016
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.