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_56812e52870cc584"}
- id
- vea_22058661b8fb5001
- frontier
- Erdős problems frontier
- source
- vs_201862fadd7dd963
- finding
- vf_7b739ee86aa8c9e6
finding binding
boundopen_question
Erdős Problem #613 has status 'disproved (lean)'. Statement: **Erdős Problem 613:** Let $n \geq 3$ and $G$ be a graph with $\binom{2n+1}{2} - \binom{n}{2} - 1$ edges. Must $G$ be the union of a bipartite graph and a graph with maximum degree less than $n$? Topics: graph theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_56812e52870cc584
vs_201862fadd7dd963
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_56812e52870cc584"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_f55fbf6d6fd7abbf
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_0cffb68166759eb1finding.assertedCandidate claim vc_56812e52870cc584 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_736c3c494690b4cbfinding.addCandidate claim vc_56812e52870cc584 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.