frontiers / 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

used by 0 · replayed by 2 producers

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

id: vea_ae4686dda5655793
frontier: Erdős problems frontier
source: vs_a62ed02e580a43bf
finding: vf_51d2512f236268a4

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #74 remains OPEN. Statement: Let $f(n)\to \infty$ possibly very slowly. Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $f(n)$ edges? Topics: graph theory, chromatic number, cycles. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_c63c144ac599c82e

vs_a62ed02e580a43bf

review context

unverified

1 events

3 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_c63c144ac599c82e"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_fd3f60b5307e0da2

caveats

No caveats recorded.

Review, event, and evaluation records

events

vev_ff5762d9193ca43efinding.asserted
Candidate claim vc_c63c144ac599c82e imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_0adc4aeaf1410235finding.add
Candidate claim vc_c63c144ac599c82e imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_2977e64d55303a92finding.note
SEMANTIC-EDGE DRAFT -> Erdos #23 (vf_4178d989faad6623) [shares_technique, confidence 0.65]: Problem 74 defines the number of edge deletions needed to make a graph bipartite, which is precisely the quantity bounded in Problem 23's make-triangle-free-graph-bipartite result. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10
vpr_a659343c9027e156finding.note
SEMANTIC-EDGE DRAFT -> Erdos #75 (vf_912ea88190378ef3) [depends_on, confidence 0.6]: Problem 75 asks about subgraphs whose minimum number of edges to delete to make them bipartite is constrained, which is exactly the bipartite-edit quantity defined in Problem 74. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10

evaluations

No evaluation rows are attached.

computational

open_question

cap_61973ee16b553d57 · vc_c63c144ac599c82e

1 events

Review, event, and evaluation records

Search Vela