Abstract In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as noncolourability of auxiliary hypergraphs. Our main technical result gives sufficient conditions on a sequence of such hypergraphs that guarantee that this noncolourability property has a sharp threshold in subhypergraphs induced by random subsets of the vertices. Furthermore, we verify these conditions in several cases of interest. In the classical setting of Ramsey theory for graphs, we show that the property of being Ramsey for a graph H in r colours has a sharp threshold in G₍, , for all r 2 and all H in a class of graphs that includes all cliques and cycles. In the arithmetic setting, we establish sharpness of thresholds for the properties corresponding to van der Waerden’s theorem and Schur’s theorem, also in any number of colours.
Friedgut et al. (Thu,) studied this question.