.png){kind=icon}
Return
Sharp thresholds for Ramsey properties
.png){kind=icon}
PRE
AI
DOI：10.1017/fms.2026.10178.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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_{n,p}$ , for all $r \geqslant 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.
Keywords:
RANDOM SUBSETS
GRAPHS
Journal
F
IF:
1.2
Papers:
140
Citations:
0
Organization
View more organizations
Cited Papers
No cited papers available