Improved upper and lower bounds on a geometric Ramsey problem

Citations of this article
Mendeley users who have this article in their library.


In Graham and Rothschild (1971), Graham and Rothschild consider a geometric Ramsey problem: finding the least N * such that if all edges of the complete graph on the points {±1}N* are 2-colored, there exist 4 coplanar points such that the 6 edges between them are monochromatic. They give an explicit upper bound: N*≤F(F(F(F(F(F(F(12,3),3),3),3),3),3),3), where F (m, n) = 2→mn, an extremely fast-growing function. We bound N * between two instances of a variant of the Hales-Jewett problem, obtaining an upper bound which is less than 2→→→6 = F (3, 6) © 2014.




Lavrov, M., Lee, M., & Mackey, J. (2014). Improved upper and lower bounds on a geometric Ramsey problem. European Journal of Combinatorics, 42, 135–144.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free