Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489)

The paper deals with independent sets in graphs \(G_ H\) for \(H\subseteq {\mathbb{R}}^+\) (the vertex set is \({\mathbb{R}}^ n\) and two vertices are joined if their distance belongs to H). The Lebesgue upper density of independent sets and the minimum number of classes in a measurable partition into independent sets are considered.