Abstract
LetH be a set of positive real numbers. We define the geometric graphG H as follows: the vertex set isR n (or the unit circleS 1) andx, y are joined if their distance belongs toH. We define the measurable chromatic number of geometric graphs as the minimum number of classes in a measurable partition into independent sets.
In this paper we investigate the difference between the notions of the ordinary and measurable chromatic numbers. We also prove upper and lower bounds on the Lebesgue upper density of independent sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. G. de Bruijn andP. Erdös. A colour problem for infinite graphs and a problem in theory of relations,Nederl. Akad. Wetensch. Proc. Ser. A.54 (1951), 371–363.
H. T. Croft, Incidence incidents,Eureka (Cambridge)30 (1967), 22–26.
P. Erdös andM. Simonovits, On the cromatic number of geometric graphs,Ars Combinatoria.9 (1980), 229–246.
K. F. Falconer, The realization of distances in measurable subsets coveringRn.J. Comb. Theory A31, 187–189.
P. Frankl andR. M. Wilson, Intersection theorems with geometric consequences,Combinatorica1 (4) (1981), 357–368.
H. Hadwiger, Ungelöste Probleme No. 40,Elemente der Math.16 (1961), 103–104.
D. G. Larman andC. A. Rogers, The realization of distances within sets in Euclidean space,Mathematika19 (1972), 1–24.
L. Moser andW. Moser, Solution to Problem 10,Canad. Math. Bull.4 (1961), 187–189.
W. Moser,Research problems in discrete geometry, (mimeographed), 1981.
D. R. Woodall, Distances realized by sets covering the plane,J. Combinatorial Theory A14 (1973), 187–200.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Székely, L.A. Measurable chromatic number of geometric graphs and sets without some distances in euclidean space. Combinatorica 4, 213–218 (1984). https://doi.org/10.1007/BF02579223
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579223