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_7f34557a982db998"}
- id
- vea_f8aed135e4943288
- frontier
- Erdős problems frontier
- source
- vs_9749af7c1e874944
- finding
- vf_acd10050f961f895
finding binding
boundopen_question
Erdős Problem #595 remains OPEN. Statement: **Erdős Problem 595 ($250)**: Is there an infinite graph $G$ which contains no $K_4$ and is not the union of countably many triangle-free graphs? A problem of Erdős and Hajnal [Er87]. Topics: graph theory, set theory. Erdős prize: $250. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_7f34557a982db998
vs_9749af7c1e874944
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_7f34557a982db998"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_79afd86d396e5e06
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e4516962d9c4b779finding.assertedCandidate claim vc_7f34557a982db998 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_47e032b28c26003afinding.addCandidate claim vc_7f34557a982db998 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.