On the density of sets of the Euclidean plane avoiding distance 1
2021 ◽
Vol vol. 23 no. 1
(Combinatorics)
◽
A subset $A \subset \mathbb R^2$ is said to avoid distance $1$ if: $\forall x,y \in A, \left\| x-y \right\|_2 \neq 1.$ In this paper we study the number $m_1(\mathbb R^2)$ which is the supremum of the upper densities of measurable sets avoiding distance 1 in the Euclidean plane. Intuitively, $m_1(\mathbb R^2)$ represents the highest proportion of the plane that can be filled by a set avoiding distance 1. This parameter is related to the fractional chromatic number $\chi_f(\mathbb R^2)$ of the plane. We establish that $m_1(\mathbb R^2) \leq 0.25647$ and $\chi_f(\mathbb R^2) \geq 3.8991$.
2015 ◽
Vol Vol. 17 no.2
(Graph Theory)
◽
Keyword(s):
2011 ◽
Vol 24
(4)
◽
pp. 432-437
◽
2009 ◽
Vol 309
(14)
◽
pp. 4746-4749
◽
Keyword(s):
2008 ◽
Vol 29
(7)
◽
pp. 1733-1743
◽
2013 ◽
Vol 27
(2)
◽
pp. 1184-1208
◽