Nicholas Pippenger
STOC 1976
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. © 1987 Akadémiai Kiadó.
Nicholas Pippenger
STOC 1976
Nicholas Pippenger
FOCS 1984
Nicholas Pippenger, Joel Spencer
Journal of Combinatorial Theory, Series A
Mark Kleiman, Nicholas Pippenger
Theoretical Computer Science