Near-extremal unit-distance sets decompose into many small dense bipartite unit graphs, and the n^{7/6} rigidity conjecture would convert this into the first improvement on the O(n^{4/3}) bound in 40 years.
Raz and J´ ozsef Solymosi
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Erd\H{o}s's unit distance problem and rigidity
Near-extremal unit-distance sets decompose into many small dense bipartite unit graphs, and the n^{7/6} rigidity conjecture would convert this into the first improvement on the O(n^{4/3}) bound in 40 years.