On the Erdös‐Sós conjecture
Mariusz Woźniak · Journal of Graph Theory · 1996
Erdös and Sós conjectured in 1963 that if G is a graph of order n and size e(G) with e(G) > ½ n(k − 1), then G contains every tree T of size k. We present some partial results; in particular the proof of the conjecture in the case k = n − 3 © 1996 John Wiley & Sons, Inc.