frontiers / frontier

Erdős problems frontier

id: vfr_37aec80d874a0239
license: CC-BY-4.0
findings: 1,256
accepted core: 6
contested: 0
links: 17
sources: 1,234
evidence: 1,256
avg conf: 0.98

used by 0 · replayed by 2 producers

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Source record

back to sources

Erdos 1946; Spencer, Szemeredi, Trotter 1984 upper bound

id: vs_acd26fe21f2593b1
frontier: Erdős problems frontier
year: 1946
type: paper

source boundary

frontier-owned

declared

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

1 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

locator

title:Erdos 1946; Spencer, Szemeredi, Trotter 1984 upper bound

imported

2026-05-10T19:27:57.607713+00:00

extraction mode

manual_curation

authors

agent:vela-curation-bot

caveats

No caveats recorded.

Bound findings

Erdos unit distance problem (1946, open): the maximum number of unit-distance pairs among n points in the plane is at most O(n^(4/3)) (Spencer-Szemeredi-Trotter 1984) and at least Omega(n^(1 + c / log log n)) (Erdos lattice construction); the truth between these is open.
theoretical · vf_bb06a4c06188a214

Evidence atoms

vea_4a70717689649273theoretical · unknown
Erdos unit distance problem (1946, open): the maximum number of unit-distance pairs among n points in the plane is at most O(n^(4/3)) (Spencer-Szemeredi-Trotter 1984) and at least Omega(n^(1 + c / log log n)) (Erdos lattice construction); the truth between these is open.

Review, event, and evaluation records

events

vev_db5aaafeab811d38finding.asserted
Manual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_0a0e0da8aeaeaaaffinding.add
Manual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10

evaluations

No evaluation rows are attached.