evidence boundary
unknownfrontiers / 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
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sourcesErdos 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.
- id
- vea_69e9c845a52258b6
- frontier
- Erdős problems frontier
- source
- vs_5be2183c0d93c56b
- finding
- vf_5f91b9804d33b469
finding binding
boundtheoretical
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.
source binding
source-boundErdos 1955 problem; later improvements by Swinnerton-Dyer 1959 and others
vs_5be2183c0d93c56b
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
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.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_45e773ec8a747348
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_caa42b2a7710d4aefinding.assertedManual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_06bf00db6ea83cf0finding.addManual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10
evaluations
No evaluation rows are attached.