Name
Abstract | ||
|---|---|---|
Erdos and Sos conjectured in 1963 that if G is a graph of order n and size e(G) with e(G) > 1/2n(k-1), then G contains every tree T of size k. We prove the conjecture in the case where G does not contain the cycle C-4. (C) 1997 Academic Press. |
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 | 6 | 0.97 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-François Saclé | 1 | 43 | 7.05 |
| Mariusz Woźniak | 2 | 204 | 34.54 |