Tree embeddings

@article{Haxell2001TreeE,
  title={Tree embeddings},
  author={Penny E. Haxell},
  journal={Journal of Graph Theory},
  year={2001},
  volume={36},
  pages={121-130}
}
We give a general theorem on embedding trees in graphs with certain expanding properties. As an application, we show that for r ˆ bt=18c, 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 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Extremal Problems in Graph Theory

P Erd
-1
View 3 Excerpts
Highly Influenced

Wide-Sense Nonblocking Networks

SIAM J. Discrete Math. • 1988
View 4 Excerpts
Highly Influenced

The ErdoÈs±SoÂs conjecture for graphs without C4

J-F. SacleÂ, M. Wozniak
J Comb Theory Ser B • 1997
View 1 Excerpt

On the Erdös-Sós conjecture

Journal of Graph Theory • 1996

On the ErdoÈs±SoÂs conjecture±the dense case 1991, manuscript in preparation

M. Ajtai, J. KomloÂs, E E.SzemereÂdi
1991
View 1 Excerpt

Extremal problems in graph theory , Theory of graphs and its applications

M. Fiedler
1965

Similar Papers

Loading similar papers…