Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space |
scientific article; zbMATH DE number 3889548
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space |
scientific article; zbMATH DE number 3889548 |
Statements
Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (English)
0 references
1984
0 references
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.
0 references
geometric graph
0 references
measurable chromatic number
0 references
independent sets
0 references
Lebesgue upper density
0 references
