Abstract
Roughly speaking, the probabilistic method works as follows: trying to prove that an object with certain properties exists, one defines an appropriate prob- ability space of objects and shows that a randomly chosen element of this space has the desired properties with a positive probability.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2011). Probabilistic Counting. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-17364-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17363-9
Online ISBN: 978-3-642-17364-6
eBook Packages: Computer ScienceComputer Science (R0)