The density of planar sets avoiding unit distances
Preprint
Abstract
By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erd\H{o}s that the density of any measurable planar set avoiding unit distances cannot exceed $1/4$. Our argument implies the upper bound of $0.2470$.
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Density Estimates of 1-Avoiding Sets via Higher Order CorrelationsDiscrete & Computational Geometry, 2020
- Array programming with NumPyNature, 2020
- Complete positivity and distance-avoiding setsMathematical Programming, 2020
- The Chromatic Number of the Plane is At Least 5: A New ProofDiscrete & Computational Geometry, 2019
- The fractional chromatic number of the planeCombinatorica, 2016
- Better Bounds for Planar Sets Avoiding Unit DistancesDiscrete & Computational Geometry, 2015
- The Density of Sets Avoiding Distance 1 in Euclidean SpaceDiscrete & Computational Geometry, 2015
- Research Problems in Discrete Geometry2005
- Measurable chromatic number of geometric graphs and sets without some distances in euclidean spaceCombinatorica, 1984
- The realization of distances within sets in Euclidean spaceMathematika, 1972