Erdős Problem #1070
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Take any \(n\) distinct points in the plane. Draw an edge between two points if they are exactly one unit apart. How many points can we always select so that no selected pair is unit distance apart?
Write \(f(n)\) for the smallest possible size of a largest such selection, over every possible configuration of \(n\) points. Erdős Problem #1070 asks for a good estimate of \(f(n)\) and, specifically, whether
for every \(n\).
Unlike Problem #1066, there is no minimum-separation requirement on the original points. This is an essential difference.
A small example
Three points at the corners of a unit equilateral triangle form a graph \(K_3\). Every two vertices are adjacent, so a largest independent set has just one vertex. Every three-point graph has at least one independent vertex; hence \(f(3)=1\).
The celebrated seven-vertex Moser spindle has independence number two, so it gives \(f(7)\le2\), an upper ratio \(2/7\). Neither example goes below one quarter.
To disprove the proposed universal one-quarter lower bound, just one realizable finite unit-distance graph with independence ratio strictly below \(1/4\) would suffice.
What is known
The maintained catalogue still labels #1070 open and records Croft's measurable lower bound \(f(n)\ge0.22936n\) and subsequent asymptotic upper constructions.
There is a significant later development: on June 26, 2026, Ákos Dúcz and Dániel Varga posted A unit-distance graph in the plane with independence ratio below 1/4. Its abstract expressly claims a finite graph with independence ratio strictly less than \(1/4\), building on geometric fractional chromatic-number techniques.
If the paper's construction and proof survive independent verification, it refutes the particular one-quarter conjecture. However, even such a counterexample would not determine the exact asymptotic value of \(f(n)/n\).
GCL's current state
Authenticated source audit #2341 flags a status conflict between the older catalogue badge and the newer author preprint. It checks the exact distinction between #1070 and the separated-point problem #1066, and proves the elementary \(f(3)=1\) example.
The newer proof is an external research claim, not a newly obtained GCL mathematical result. GCL has not checked its enormous finite unit-distance construction or every lemma in its fractional-colouring argument.
What remains
The immediate mathematical-editorial task is to verify the Dúcz–Varga proof, including the existence of a genuine finite Euclidean unit-distance graph, the independence bound and all analytic or limiting steps used to infer it. A verified counterexample should update the quarter-bound status without falsely declaring the whole extremal function determined.
Sources and claim boundaries
- Erdős Problem #1070, maintained catalogue and prior bounds.
- Dúcz and Varga (June 2026), arXiv:2606.28157, author-reported counterexample, proof not independently adjudicated.
- Authenticated GCL audit #2341, recorded status conflict and precise problem normalization.
- This manuscript is source-bounded and unaccepted, and does not certify the claimed new result.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2341 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.