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$ …