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
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_13614a77dd861900"}
- id
- vea_cddd15841c50f6e1
- frontier
- Erdős problems frontier
- source
- vs_194e4ae5497b697f
- finding
- vf_80897a5c05f62d90
finding binding
boundopen_question
Erdős Problem #566 remains OPEN. Statement: Let $G$ be such that any subgraph on $k$ vertices has at most $2k-3$ edges. Is it true that, if $H$ has $m$ edges and no isolated vertices, then $\hat{r}(G,H) \ll m$? In other words: if $G$ is sparse (every induced subgraph on $k$ vertices has $≤ 2k-3$ edges), is $G$ Ramsey size linear? Topics: graph theory, ramsey theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_13614a77dd861900
vs_194e4ae5497b697f
review context
unverified1 events
1 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_13614a77dd861900"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_f1f6fb39213f57dd
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_9af7fc90224bb78dfinding.assertedCandidate claim vc_13614a77dd861900 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_826b00ef48be0428finding.addCandidate claim vc_13614a77dd861900 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.