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
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
No statement authored. accepted findings
faithfulness
- faithful
vf_caaa525f7259eff1reviewer:will-blair · 2026-06-10 - variant
vf_b4ecf5ea9e1f317breviewer:will-blair · 2026-06-10 - variant
vf_63cf7f09150f3200reviewer:will-blair · 2026-06-10 - variant
vf_20dd984366cd93ddreviewer:will-blair · 2026-06-10 - faithful
vf_16db6f3dba299e5freviewer:will-blair · 2026-06-10 - faithful
vf_748cf8097c3816cfreviewer:will-blair · 2026-06-10 - faithful
vf_9e571c292bedde14reviewer:will-blair · 2026-06-10
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce projects/erdos-problemssnapshot adf5cd08914be106…Past week: 1 key · 37 events · 24 accepted · 0 refused · 13 in review
recorded · 1262 events
press the seal to re-verify on this device
Signals
Finding types
1,256 findings- open_question862
- theoretical393
- mechanism1
Review state
1,256 findings- unreviewed1,256
Flow
Top findings
all stateErdős Problem #105 has status 'disproved (lean)'. Topics: geometry. Erdős prize: $50. Not yet formalized in Lean. OEIS: N/A.
0.99vf_0048a13ac8707d73assertederdos-db-tru· 2wErdős Problem #40 remains OPEN. Statement: For what functions $g(N) → \infty$ is it true that $$\lvert A\cap \{1,\ldots,N\}\rvert \gg \frac{N^{1/2}}{g(N)}$$ implies $\limsup 1_A\ast 1_A(n)=\infty$? Topics: number theory, additive basis. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
0.99vf_0085928f0ac67d01assertederdos-db-tru· 2wErdős Problem #461 remains OPEN. Topics: number theory, primes. Erdős prize: no. Not yet formalized in Lean. OEIS: possible.
0.99vf_00cdc486fa764069assertederdos-db-tru· 2wErdős Problem #861 is SOLVED. Topics: number theory, sidon sets. Erdős prize: no. Not yet formalized in Lean. OEIS: A143824, A227590, A003022, A143823.
0.99vf_00dc0ceaaa58ab77assertederdos-db-tru· 2wErdős Problem #71 has been PROVED (Erdős's conjecture holds). Topics: graph theory, cycles. Erdős prize: no. Not yet formalized in Lean. OEIS: N/A.
0.99vf_00e14bb157245345assertederdos-db-tru· 2wErdős Problem #641 has been DISPROVED (a counterexample is known). Topics: graph theory. Erdős prize: no. Not yet formalized in Lean. OEIS: N/A.
0.99vf_0106baf19a411342assertederdos-db-tru· 2wErdős Problem #343 has been PROVED (Erdős's conjecture holds). Topics: number theory, complete sequences. Erdős prize: no. Not yet formalized in Lean. OEIS: N/A.
0.99vf_01262901c2f60e1fassertederdos-db-tru· 2wErdős Problem #903 has been PROVED (Erdős's conjecture holds). Topics: combinatorics. Erdős prize: no. Not yet formalized in Lean. OEIS: N/A.
0.99vf_0139666d12dffaf1assertederdos-db-tru· 2wErdős Problem #610 has been PROVED (Erdős's conjecture holds). Topics: graph theory. Erdős prize: no. Not yet formalized in Lean. OEIS: possible.
0.99vf_01468af98db2dcecassertederdos-db-tru· 2wErdős Problem #749 remains OPEN. Statement: Let $\epsilon>0$. Does there exist $A\subseteq \mathbb{N}$ such that the lower density of $A+A$ is at least $1-\epsilon$ and yet $1_A\ast 1_A(n) \ll_\epsilon 1$ for all $n$? Topics: additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
0.99vf_017fe040a7805919assertederdos-db-tru· 2wErdős Problem #802 remains OPEN. Topics: graph theory. Erdős prize: no. Not yet formalized in Lean. OEIS: N/A.
0.99vf_0188a388ddc15094assertederdos-db-tru· 2wErdős Problem #186 is SOLVED. Topics: additive combinatorics. Erdős prize: no. Not yet formalized in Lean. OEIS: A389784.
0.99vf_0196f7cbc35ff04cassertederdos-db-tru· 2wShowing 12 of 1,256