Measurable sets with excluded distances

DOI10.1007/s00039-008-0673-8zbMath1169.52005OpenAlexW2141355416MaRDI QIDQ5902094

Boris Bukh

Publication date: 17 June 2009

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00039-008-0673-8

zbMATH Keywords

chromatic numberdistance graphHadwiger-Nelson problemEuclidean Ramsey theorychromatic number of the planeexcluded distancesmeasurable coloring

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Related Items

Open sets avoiding integral distances, Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\), A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces, Coloring distance graphs on the plane, Geometrical sets with forbidden configurations, Odd wheels are not odd-distance graphs, A note on configurations in sets of positive density which occur at all large scales, The grasshopper problem, Chromatic numbers of algebraic hypergraphs, On a generalization of the Hadwiger-Nelson problem, GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES, Odd Wheels Are Not Odd-distance Graphs, Complete positivity and distance-avoiding sets