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_d263cdf653755afc"}
- id
- vea_3f67c910762b6e44
- frontier
- Erdős problems frontier
- source
- vs_ef42afe81475f879
- finding
- vf_4178d989faad6623
finding binding
boundopen_question
Erdős Problem #23 has status 'falsifiable'. Statement: Can every triangle-free graph on $5n$ vertices be made bipartite by deleting at most $n^2$ edges? Topics: graph theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A389646.
source binding
source-boundcap_61973ee16b553d57 · vc_d263cdf653755afc
vs_ef42afe81475f879
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_d263cdf653755afc"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_8e2c9d423a50ae55
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_a68c2db889c20168finding.assertedCandidate claim vc_d263cdf653755afc imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_b73146afd4c1bee9finding.addCandidate claim vc_d263cdf653755afc imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.