Title of article
The Erdős–Sós Conjecture for Graphs withoutC4
Author/Authors
Saclé، نويسنده , , Jean-François and Wo?niak، نويسنده , , Mariusz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
6
From page
367
To page
372
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526276
Link To Document