New answers tagged

0

The two most relevant rigorous results are: Ehud Friedgut, Sharp thresholds of graph properties, and the $k$-SAT problem. This paper (with an appendix by Jean Bourgain) shows that $k$-SAT exhibits a sharp threshold. However, a priori this threshold could depend on $n$ (i.e., this method cannot show that $\alpha$ is constant). Jian Ding, Allan Sly, Nike Sun, ...


Top 50 recent answers are included