Symmetric and asymmetric Ramsey properties in random hypergraphs

Luca Gugelmann, Rajko Nenadov, Yury Person +3

A celebrated result of Rödl and Ruciński states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist p…