Revision of Probabilistic combinatorics front page from Sat, 13/12/2008 - 00:59

Quick description

Probabilistic combinatorics has two rather distinct flavours. The first is the study of the typical behaviour of random combinatorial objects, such as a graph with $n$ vertices where each edge is chosen randomly and independently with probability $p$ . The second is the use of random constructions to prove statements that do not mention probability, a classic example being Erdős's proof that the Ramsey number $R(k,k)$ is at least $2^{k/2}$ . This page contains links to several articles: some are general articles about the probabilistic method, while others are about particular methods that have been developed to estimate probabilities in situations where they are hard to determine.