The Erdős–Sós Conjecture for Graphs withoutC4

Erdős and Sós conjectured in 1963 that ifGis a graph of ordernand sizee(G) withe(G)>12n(k−1), thenGcontains every treeTof sizek. We prove the conjecture in the case whereGdoes not contain the cycleC4.