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.
Similar content being viewed by others
5. References
N. Alon andF. R. K. Chung, Explicit constructions of linear-sized tolerant networks,to appear.
J. Beck, On size Ramsey number of paths, trees, and circuits. I,J. Graph Theory,7 (1983), 115–129.
L. Lovász,Combinatorial problems and exercises, North-Holland, 1979.
A. Lubotzky, R. Phillips andP. Sarnak, Ramanujan graphs,to appear.
L. Pósa, Hamiltonian circuits in random graphs,Discrete Math.,14 (1976), 359–364.