The density of sets avoiding distance 1 in Euclidean space
Langue
en
Document de travail - Pré-publication
Résumé en anglais
We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz ...Lire la suite >
Mots clés en anglais
unit distance graph
measurable chromatic number
theta number
linear programming