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

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Source record

back to sources

cap_61973ee16b553d57 · vc_b9f07b01e3fba855

id: vs_b2ca93c9b664c788
frontier: Erdős problems frontier
type: synthetic_report

source boundary

frontier-owned

synthetic

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

2 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

external source

locator

title:cap_61973ee16b553d57 · vc_b9f07b01e3fba855

imported

2026-05-30T00:42:06.826507+00:00

extraction mode

artifact_to_state_import

authors

Erdős Open-Problem spine ingest

caveats

source requires human review before being treated as evidence

Bound findings

Erdős Problem #108 remains OPEN. Statement: For every r ≥ 4 and k ≥ 2 is there some finite f(k,r) such that every graph of chromatic number ≥ f(k,r) contains a subgraph of girth ≥ r and chromatic number ≥ k? Topics: graph theory, chromatic number, cycles. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
open_question · vf_af9a340f76a26927

Evidence atoms

vea_12d34d95cdfbc48fcomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_b9f07b01e3fba855"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_7bf3d45c7fc1afacfinding.add
Candidate claim vc_b9f07b01e3fba855 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_ee828e1a98ce8591finding.note
SEMANTIC-EDGE DRAFT -> Erdos #750 (vf_790fcc99a314fb3c) [shares_technique, confidence 0.6]: Both concern forcing high-girth subgraphs inside graphs of large (here infinite) chromatic number, using the same Erdős high-girth high-chromatic-number probabilistic/construction machinery. -- 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.