Abstract
The probabilistic method is most striking when it is applied to prove theorems whose statement does not seem to suggest the need for probability at all. It is therefore surprising what results may be obtained from such simple principles like the counting sieve:
The probability of a disjunction of events is at most the sum of the probabilities of the events, Prob (∪ A i ) ⩽ Σ Prob (A i ).
This is a preview of subscription content, log in via an institution to check access.
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). Counting Sieve. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive