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
Mark Kleiman, Nicholas Pippenger
Theoretical Computer Science
Nicholas Pippenger
Journal of Computer and System Sciences
Nicholas Pippenger, Leslie G. Valiant
Journal of the ACM