Better Bounds for Planar Sets Avoiding Unit Distances
- 9 December 2015
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 55 (3) , 642-661
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- The Density of Sets Avoiding Distance 1 in Euclidean SpaceDiscrete & Computational Geometry, 2015
- Quantitative stability in the isodiametric inequality via the isoperimetric inequalityTransactions of the American Mathematical Society, 2013
- Fourier analysis, linear programming, and densities of distance avoiding sets in $\mathbb{R}^n$Journal of the European Mathematical Society, 2010
- The Mathematical Coloring Book2009
- The Brunn-Minkowski inequalityBulletin of the American Mathematical Society, 2002
- Bounds on the measurable chromatic number of RnDiscrete Mathematics, 1989
- Measurable chromatic number of geometric graphs and sets without some distances in euclidean spaceCombinatorica, 1984
- The realization of distances in measurable subsets covering RnJournal of Combinatorial Theory, Series A, 1981
- The realization of distances within sets in Euclidean spaceMathematika, 1972
- Metric Spaces and Completely Monotone FunctionsAnnals of Mathematics, 1938