13 citations · 13 across the 1 of their papers we have counts for
1 paper · 2 filters
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≥2 there exist p…