Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the density of se ...
Article

On the density of sets of the Euclidean plane avoiding distance 1

Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot ORCID
Download article
Open on arXiv
Submitted on
January 31, 2019
Accepted on
March 22, 2021
Published on
August 31, 2021
Last modified on
March 31, 2025
Volume 23
vol. 23:1
Combinatorics
DOI
10.46298/dmtcs.5153
License
arXiv.org - Non-exclusive license to distribute
European Commission
714704
Cuts and decompositions: algorithms and combinatorial properties
Indicators
1182
Views
844
Downloads

On the density of sets of the Euclidean plane avoiding distance 1

Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot ORCID
Abstract
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$. Comment: 13 pages, 8 figures
Keywords
  • Mathematics - Metric Geometry
  • Computer Science - Discrete Mathematics
  • Mathematics - Combinatorics
Mathematics Subject Classification 2020
  • 05C12 - Distance in graphs
  • 05C15 - Coloring of graphs and hypergraphs
  • 52C20 - Tilings in \(2\) dimensions (aspects of discrete geometry)
  • 52C26 - Circle packings and discrete conformal geometry
Cited by

Source: OpenCitations

  • The density of planar sets avoiding unit distances

    Mathematical Programming

    Authors : Gergely Ambrus ORCID, Adrián Csiszárik ORCID, Máté Matolcsi ORCID, Dániel Varga ORCID, Pál Zsámboki

    Journal reference : Volume 207, 2023, pp. 303-327

    DOI : 10.1007/s10107-023-02012-9
Preview
Loading PDF preview...