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

DOI10.46298/dmtcs.5153zbMath1498.05078arXiv1810.00960OpenAlexW3022820586WikidataQ114020626 ScholiaQ114020626MaRDI QIDQ5038188

Antoine Sédillot, Arnaud Pêcher, Thomas Bellitto

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00960

zbMATH Keywords

fractional chromatic numberHadwiger-Nelson problemunit-distance graphssets avoiding distanceweighted independence ratio

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Circle packings and discrete conformal geometry (52C26)

Related Items (2)

Coloring distance graphs on the plane ⋮ New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023

Cites Work

• Unnamed Item
• Unnamed Item
• Better bounds for planar sets avoiding unit distances
• The fractional chromatic number of the plane
• The ellipsoid method and its consequences in combinatorial optimization
• Separating codes and traffic monitoring
• On the density of sets avoiding parallelohedron distance 1
• The density of sets avoiding distance 1 in Euclidean space
• The chromatic number of the plane is at least 5
• On the density of cyclotomic lattices constructed from codes
• The realization of distances within sets in Euclidean space

This page was built for publication: On the density of sets of the Euclidean plane avoiding distance 1