The Erdős Unit Distance Problem for Small Point Sets
Studia Scientiarum Mathematicarum Hungarica · 11.11.2026 · 63 (3) · 191-209
DOI: 10.1556/012.2026.04350 ↗Kurz gefasst
Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, erschienen am 11.11.2026. Verfasst von Boris Alexeev und 2 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
We improve the best known upper bound on the number of edges in a unit-distance graph on n vertices for each n ∈ {16, … , 30}. When n ≤ 21, our bounds match the best known lower bounds, and we fully enumerate the densest unit-distance graphs in these cases. On the combinatorial side, our principal technique is to more efficiently generate ℱ -free graphs for a set of forbidden subgraphs ℱ . On the algebraic side, we are able to determine programmatically whether many graphs are unit-distance, using a custom embedder that is more efficient in practice than tools such as cylindrical algebraic decomposition.
Zitieren
APA
Alexeev, B., Mixon, D. G., & Parshall, H. (2026). The Erdős Unit Distance Problem for Small Point Sets. Studia Scientiarum Mathematicarum Hungarica, 63(3), 191-209. https://doi.org/10.1556/012.2026.04350
Vancouver
Alexeev B, Mixon DG, Parshall H. The Erdős Unit Distance Problem for Small Point Sets. Studia Scientiarum Mathematicarum Hungarica. 2026;63(3):191-209. doi:10.1556/012.2026.04350
BibTeX
@article{Alexeev2026,
author = {Alexeev, Boris and Mixon, Dustin G. and Parshall, Hans},
title = {The Erdős Unit Distance Problem for Small Point Sets},
journal = {Studia Scientiarum Mathematicarum Hungarica},
year = {2026},
volume = {63},
number = {3},
pages = {191--209},
doi = {10.1556/012.2026.04350}
}
EUVIMED