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
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_f126b1ab58a953ef"}
- id
- vea_8ea43f2d2c4052fd
- frontier
- Erdős problems frontier
- source
- vs_a0ddc36268b6e6e2
- finding
- vf_d1f1c6f3b19aaf08
finding binding
boundopen_question
Erdős Problem #740 remains OPEN. Statement: Let $\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$. Let $r\geq 1$. Must $G$ contain a subgraph of chromatic number $\mathfrak{m}$ which does not contain any odd cycle of length $\leq r$? Topics: graph theory, chromatic number. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_f126b1ab58a953ef
vs_a0ddc36268b6e6e2
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_f126b1ab58a953ef"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_175a72e574dc6c31
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_2313a704f33b7e8efinding.assertedCandidate claim vc_f126b1ab58a953ef imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_784d8727aac4a408finding.addCandidate claim vc_f126b1ab58a953ef imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.