Graham's boundedness conjecture for Euclidean Ramsey sets

A finite set $X$ in a Euclidean space is Ramsey if, for every $k\in\mathbb{N}$, some dimension contains a monochromatic congruent copy of $X$ under every $k$-colouring. Graham's boundedness conjecture. For every $k,n\in\mathbb{N}$, there exists $d=d(k,n)\in\mathbb{N}$ such that whenever $X$ is a Ramsey set of size at most $n$ in some Euclidean space, every $k$-colouring of $\mathbb{R}^d$ contains a monochromatic congruent copy of $X$. This is presented as an open boundedness problem for Ramsey sets.