Ronald Fagin, Jurg Nievergelt, et al.
ACM Transactions on Database Systems (TODS)
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ó.
Ronald Fagin, Jurg Nievergelt, et al.
ACM Transactions on Database Systems (TODS)
Nicholas Pippenger
Journal of Computer and System Sciences
Nicholas Pippenger, Joel Spencer
Journal of Combinatorial Theory, Series A
Nicholas Pippenger
Journal of Computer and System Sciences