Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

We study Ramsey restricted to the case of geometric colourings, in this case the upper bounds are significantly smaller than in the purely combinatorial case. Almost matching lower bounds were constructed by Conlon et al. We simplify their example to a more natural one which has some interesting applications.