Lower bounds on geometric Ramsey functionsAlgebra & Discrete Mathematics
|Speaker:||Dr. Edgardo Roldan Pensado, CINNMA- Universidad de Queretaro|
|Start time:||Mon, Mar 31 2014, 12:10PM|
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.