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

id
vea_58eb7de01c55f766
frontier
Erdős problems frontier
source
vs_2ddcc2f1849d15d6
finding
vf_d8e9f7fe0cf1ce49

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #1067 has status 'disproved (lean)'. Statement: Does every graph with chromatic number $\aleph_1$ contain an infinitely connected subgraph with chromatic number $\aleph_1$? Komjáth [Ko13] proved that it is consistent that the answer is no. This was improved by Soukup [So15], who constructed a counterexample using no extra set-theoretical assumptions. A simpler elementary example was given by Bowler and Pitz [BoPi24]. This was formalized in Lean by Alexeev using Aristotle and Aleph Prover. Topics: graph theory, set theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_aa37c7f625291d3b

vs_2ddcc2f1849d15d6

review context

unverified

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_8db134fae9ba552b

caveats

No caveats recorded.

Review, event, and evaluation records

2

events

  • vev_8d7fce756da895c5finding.asserted

    Candidate claim vc_aa37c7f625291d3b imported from artifact packet cap_61973ee16b553d57

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

reviewable changes

  • vpr_d1d6ee541aae8350finding.add

    Candidate claim vc_aa37c7f625291d3b 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.