Skip to main content
Log in

Expanding graphs contain all small trees

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

The assertion of the title is formulated and proved. The result is then used to construct graphs with a linear number of edges that, even after the deletion of almost all of their edges or almost all of their vertices, continue to contain all small trees.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

5. References

  1. N. Alon andF. R. K. Chung, Explicit constructions of linear-sized tolerant networks,to appear.

  2. J. Beck, On size Ramsey number of paths, trees, and circuits. I,J. Graph Theory,7 (1983), 115–129.

    MATH  MathSciNet  Google Scholar 

  3. L. Lovász,Combinatorial problems and exercises, North-Holland, 1979.

  4. A. Lubotzky, R. Phillips andP. Sarnak, Ramanujan graphs,to appear.

  5. L. Pósa, Hamiltonian circuits in random graphs,Discrete Math.,14 (1976), 359–364.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Friedman, J., Pippenger, N. Expanding graphs contain all small trees. Combinatorica 7, 71–76 (1987). https://doi.org/10.1007/BF02579202

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579202

AMS subject classification (1980)

Navigation