| Let Vn (p) = f0; 1g n (2007) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. In their seminal work which initiated random graph theory Erdos and R'enyi 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. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||