Claims

../

1981_12_01_frankl_wilson: Frankl and Wilson's 1981 intersection theorem gives an exponential lower bound on the chromatic number of the unit distance graph of n-dimensional space, answering the exponential-growth question yes; refereed.

2000_04_30_raigorodskii: Raigorodskii's 2000 note proves that the chromatic number of the unit distance graph of n-dimensional space is at least (1.239...+o(1))^n, raising Frankl and Wilson's base and answering exponential growth yes; refereed.

---