Name
Abstract | ||
|---|---|---|
We give a general theorem on embedding trees in graphs with certain expanding properties. As an application, we show that for r = ⌊t-18⌋, any graph with average degree greater than t - 1 that does not contain a copy of K2,r contains every tree with t edges as a subgraph. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 121–130, 2001 |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1002/1097-0118(200103)36:3<>1.0.CO;2-S | Journal of Graph Theory |
Keywords | DocType | Volume |
average degree,Inc. J Graph Theory,general theorem,embedding tree,tree embeddings,John Wiley | Journal | 36 |
Issue | Citations | PageRank |
3 | 8 | 0.82 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |