Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Probabilistic Method

Combinatorics and Graph Theory

The probabilistic method, pioneered by the mathematician Paul Erdos, is a nonconstructive technique used mainly in combinatorics for proving that a mathematical object with some prescribed property exists: if choosing an object at random from a suitable class of objects has a probability greater than zero of having the desired property, then an object with that property must exist, even though the proof never exhibits one directly. Although the argument uses probability, its conclusion that such an object exists is certain rather than merely likely. Beyond combinatorics, the method has been applied in number theory, linear algebra, real analysis, computer science, including randomized rounding algorithms, and information theory. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

In Branch

Source Probabilistic Method (Wikipedia)
Sources
Probabilistic Method (Wikipedia)
In Branch: Combinatorics, Lead sentence
Quote, In Branch: Combinatorics, Lead sentence
od is a nonconstructive method, primarily used in combinatorics and pioneered by Paul Erdős, for proving the existence of a prescr
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.