Ayşegül Kula

Multiple Distance Ramsey Bounds For Graphs in Euclidean Spaces

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 monochromatic copy of $H$ whose edges have distances in $A$. Extending the graph-copy framework of Axenovich, Liu, and Sagdeev and a multipl...