Vela

frontiers / frontier

Erdős problems frontier

constellation seal · derived from vfr_37aec80d874a0239
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

used by 0 · replayed by 2 producers

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_bc525da52a3c21a4"}

id
vea_6326cacfed6a65a4
frontier
Erdős problems frontier
source
vs_500795905cb72070
finding
vf_1321ba201d47f508

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #64 has status 'falsifiable'. Statement: Does every finite graph with minimum degree at least $3$ contain a cycle of length $2^k$ for some $k \geq 2$? Topics: graph theory, cycles. Erdős prize: $1000. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_bc525da52a3c21a4

vs_500795905cb72070

review context

unverified

1 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_bc525da52a3c21a4"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_9b4a10d1a9abfefc

caveats

No caveats recorded.

Review, event, and evaluation records

3

events

  • vev_464db504c635b2fdfinding.asserted

    Candidate claim vc_bc525da52a3c21a4 imported from artifact packet cap_61973ee16b553d57

    reviewer:erdos-db-trustreviewer:erdos-db-trust · 2026-05-30

reviewable changes

  • vpr_9a21dff4282f0339finding.note

    SEMANTIC-EDGE DRAFT -> Erdos #108 (vf_af9a340f76a26927) [related, confidence 0.5]: Both are forcing problems for cycle lengths from a degree/chromatic hypothesis — 64 forces a cycle of length 2^k from min degree 3, 108 forces cycles of given girth/length from large chromatic number. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.

    agent — machine actor, no signing keypending_review · agent:semantic-edge-extractor · 2026-06-10

  • vpr_e586f370a65c8ea5finding.add

    Candidate claim vc_bc525da52a3c21a4 imported from artifact packet cap_61973ee16b553d57

    agent — machine actor, no signing keyapplied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.

finding.noted · reviewer:will-blair · 2 days

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.