Abstract
As described in previous sections, the basic probabilistic method works as follows: trying to prove that an object with certain properties exists, one defines an appropriate probability space of objects and then shows that the desired properties hold in this space with positive probability. In this section, we consider situations where the “random” object does not have all the desired properties but may have a few “blemishes.” With a small alteration, we remove the blemishes, giving the desired structure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2001). The Deletion Method. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive