Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5808059 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The realization of distances in measurable subsets covering \(R^ n\). / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection theorems with geometric consequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The realization of distances within sets in Euclidean space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848394 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3310509 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distances realized by sets covering the plane / rank | |||
Normal rank |
Revision as of 16:56, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space |
scientific article |
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