evidence boundary
supportsfrontiers / 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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_08e71ff35176a590"}
- id
- vea_1f601d54c56e85b9
- frontier
- Erdős problems frontier
- source
- vs_54e326be3ed6aa6b
- finding
- vf_8fdce4bf9419e970
finding binding
boundopen_question
Erdős Problem #564 remains OPEN. Statement: Let $R_3(n)$ be the minimal $m$ such that if the edges of the $3$-uniform hypergraph on $m$ vertices are $2$-coloured then there is a monochromatic copy of the complete $3$-uniform hypergraph on $n$ vertices. Is there some constant $c>0$ such that $$ R_3(n) \geq 2^{2^{cn}}? $$ Topics: graph theory, ramsey theory, hypergraphs. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_08e71ff35176a590
vs_54e326be3ed6aa6b
review context
unverified1 events
2 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_08e71ff35176a590"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_d4885cebeb165cf9
caveats
No caveats recorded.
Review, event, and evaluation records
3events
vev_9ae8947aa211559dfinding.assertedCandidate claim vc_08e71ff35176a590 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_8c5f8f6b9e93547bfinding.noteSEMANTIC-EDGE DRAFT -> Erdos #562 (vf_187280ca6f4d09c4) [specializes, confidence 0.9]: 564 is the r=3 special case of 562's general r-uniform hypergraph Ramsey number R_r(n), asking for monochromatic cliques in 2-colourings of complete 3-uniform hypergraphs. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10
vpr_e73b8b5b845dc07dfinding.addCandidate claim vc_08e71ff35176a590 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.