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

DOI10.1016/0097-3165(81)90014-5zbMATH Open0469.05021OpenAlexW2006159486MaRDI QIDQ1156808FDOQ1156808

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

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

Cites Work

• Title not available (Why is that?)
• The realization of distances within sets in Euclidean space
• Title not available (Why is that?)
• Distances realized by sets covering the plane
• THREE LATTICE-POINT PROBLEMS OF STEINHAUS

Cited In (28)

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

This page was built for publication: The realization of distances in measurable subsets covering \(R^ n\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156808)