The realization of distances in measurable subsets covering \(R^ n\).

DOI10.1016/0097-3165(81)90014-5zbMath0469.05021OpenAlexW2006159486MaRDI QIDQ1156808

Kenneth J. Falconer

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90014-5

zbMATH Keywords

measurable setschromatic number of a graphconfiguration of pointsdivision of Rn

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15)

Related Items

On the measurable chromatic number of a space of dimension \(n \leq 24\), On some problems of Euclidean Ramsey theory, Fractional and \(j\)-fold coloring of the plane, Better bounds for planar sets avoiding unit distances, The equality of fractional dimensions for certain cellular automata, Computing fractal dimensions for additive cellular automata, Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\), On the chromatic number of an infinitesimal plane layer, A recursive Lovász theta number for simplex-avoiding sets, Coloring distance graphs on the plane, Axiom of choice and chromatic number of the plane, Polynomial configurations in sets of positive upper density over local fields, Measurable sets with excluded distances, On a generalization of the Hadwiger-Nelson problem, Chromatic numbers of spheres, The fractional chromatic number of the plane, Triangle colorings require at least seven colors, ORTHOGONAL COLORINGS OF THE SPHERE, Finite $\epsilon$-unit distance graphs, The Hadwiger–Nelson Problem, Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space, Lower bounds for the measurable chromatic number of the hyperbolic plane, Bounds on the measurable chromatic number of \({\mathbb{R}}\), On the density of sets avoiding parallelohedron distance 1, Lower bounds for measurable chromatic numbers, Complete positivity and distance-avoiding sets

Cites Work

• Distances realized by sets covering the plane
• THREE LATTICE-POINT PROBLEMS OF STEINHAUS
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item