Minerval
Sourceunknowntext stored

The Erdős unit distance problem for small point sets

Author not recordedDate not recordedOriginal︎ ↗Archived copy

Claims1
ExaminationsNone
Text45 sections
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 9, 2026
ReachNo copies recorded
StructureIn 1 claim's map0 sources downstream across 1 claim
EvidenceNot yet read

Examinations

None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.

Text60 passages · 0 marked

No examination yetMarked passage
Skip to main content0 passages
Search1 passage
Log in0 passages
Search arXiv0 passages
Press Enter to search · Advanced search0 passages
Mathematics > Combinatorics2 passages
Title: The Erdős unit distance problem for small point sets0 passages
Authors: Boris Alexeev , Dustin G. Mixon , Hans Parshall10 passages
Focus to learn more1 passage
Submission history4 passages
View PDF1 passage
TeX Source10 passages
References & Citations0 passages
SciX0 passages
Google Scholar0 passages
Semantic Scholar1 passage
BibTeX formatted citation3 passages
Bookmark0 passages
Bibliographic Tools0 passages
Bibliographic and Citation Tools0 passages
Bibliographic Explorer Toggle1 passage
Connected Papers Toggle1 passage
Litmaps Toggle3 passages
Code, Data, Media0 passages
Code, Data and Media Associated with this Article2 passages
Links to Code Toggle1 passage
DagsHub Toggle1 passage
GotitPub Toggle1 passage
Huggingface Toggle1 passage
ScienceCast Toggle1 passage
Demos0 passages
Demos0 passages
Replicate Toggle1 passage
Spaces Toggle1 passage
Spaces Toggle1 passage
Related Papers0 passages
Recommenders and Search Tools0 passages
Link to Influence Flower1 passage
Core recommender toggle1 passage
Author0 passages
Venue0 passages
Institution0 passages
Topic0 passages
About arXivLabs7 passages
Major funding support from3 passages

Not found in the text 1

As quoted

Let U(n) denote the set of unit-distance graphs on n vertices, and let u(n) := max{|E(G)| : G ∈ U(n)} denote the maximum number of edges in such a graph. (This is known as A186705(n) in the On-Line Encyclopedia of Integer Sequences [12].)

Erdős's unit distance problem is equivalent to finding the maximum number of edges of a unit-distance graph on n vertices.Verified

Not yet read by this claim’s Steward.

Lineage across 1 claim

Draws on · none recorded
This source
The Erdős unit distance problem for small point sets
in 1 claim's map
Drawn on by · none recorded

Record

Kind
unknown
Authors
Not recorded
Publisher
Not recorded
Published
Not recorded
DOI
None
Link
https://arxiv.org/abs/2412.11914
Archived copy
https://web.archive.org/web/20260826102515/https://arxiv.org/abs/2412.11914
Stored text
4,291 characters, retrieved Sep 16, 2026 · 45 sections, 60 passages
Claims extracted
Not recorded
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 9, 2026

History 2

  1. Nov 9, 2026FactsFacts fetcher · Facts looked up
  2. Sep 16, 2026Entered the graphEntered the graph; no copy stored
The Erdős unit distance problem for small point sets · Minerval