Erdős Problem 704

### What is the conjecture

https://www.erdosproblems.com/704

Let $G_n$ be the unit distance graph in $\mathbb{R}^n$, with two vertices joined by an edge if and only if the distance between them is $1$.

Estimate the chromatic number $\chi(G_n)$. Does it grow exponentially in $n$? Does
$$\lim_{n\to \infty}\chi(G_n)^{1/n}$$
exist?

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else