Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1006/jctb.1997.1758 | Journal of Combinatorial Theory, Series B |
DocType | Volume | Issue |
Journal | 70 | 2 |
ISSN | Citations | PageRank |
0095-8956 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J.-F. Saclé | 1 | 75 | 12.69 |
| Mariusz Woźniak | 2 | 204 | 34.54 |