Multiple Distance Ramsey Bounds For Graphs in Euclidean Spaces

Ayşegül Kula, Mohamed Omar, Jonah Stockwell +1

For a finite set $A\subset {\mathbb{R}}_{>0}$ and a finite graph $H$, let ${\chi }_H({\mathbb{R}}^n;A)$ be the minimum number of colors required to color ${\mathbb{R}}^n$ while avoiding a mon…