Indexed metadata
On the density of sets of the Euclidean plane avoiding distance 1
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
Source abstract
A subset is said to avoid distance if: In this paper we study the number which is the supremum of the upper densities of measurable sets avoiding distance 1 in the Euclidean plane. Intuitively, 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 of the plane. We establish that and .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.