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 1955 problem; later improvements by Swinnerton-Dyer 1959 and others

id: vs_5be2183c0d93c56b
frontier: Erdős problems frontier
year: 1955
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 1955 problem; later improvements by Swinnerton-Dyer 1959 and others

imported

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

extraction mode

manual_curation

authors

agent:vela-curation-bot

caveats

No caveats recorded.

Bound findings

Erdos minimum-overlap problem (1955, partial bounds known): given a partition of {1,...,2n} into A and B with |A|=|B|=n, the minimum over all partitions of max_k |{(a,b) in A x B : b - a = k}| is between c1*n and c2*n with the constants improved iteratively.
theoretical · vf_5f91b9804d33b469

Evidence atoms

vea_69e9c845a52258b6theoretical · unknown
Erdos minimum-overlap problem (1955, partial bounds known): given a partition of {1,...,2n} into A and B with |A|=|B|=n, the minimum over all partitions of max_k |{(a,b) in A x B : b - a = k}| is between c1*n and c2*n with the constants improved iteratively.

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.