Further improving of upper bound on a geometric Ramsey problem

Eryk Lipka

We consider following geometric Ramsey problem: find the least dimension $n$ such that for any 2-coloring of edges of complete graph on the points $\{\pm 1{\}}^n$ there exists 4-vert…