IstvánTomon

A graph $G$ is semilinear of bounded complexity if the vertices of $G$ are elements of ${\mathbb{R}}^d$, and the edges of $G$ are defined by the sign patterns of $t$ linear functions, where $d$ and $t$ are constants. In this talk, I will present several results about the symmetric and asymmetric Ramsey properties of semilinear …