Every monotone graph property has a sharp threshold

In their seminal work which initiated random graph theory Erdös and Rényi discovered that many graph properties have sharp thresholds as the number of vertices tends to infinity. We prove a conjecture of Linial that every monotone graph property has a sharp threshold. This follows from the following theorem. Let denote the Hamming space endowed with the probability measure defined by , where . Let be a monotone subset of . We say that is symmetric if there is a transitive permutation group on such that is invariant under . Theorem. For every symmetric monotone , if then for . ( is an absolute constant.)