evidence boundary
unknownfrontiers / 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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sourcesErdos-Posa theorem (1965, solved): for every k, there is a function f such that every graph either contains k vertex-disjoint cycles or has a feedback vertex set of size at most f(k); f(k) = O(k log k) is tight.
- id
- vea_1716e99ca4cbbee5
- frontier
- Erdős problems frontier
- source
- vs_d2618ca3fa60838b
- finding
- vf_98478e05babb8fb3
finding binding
boundtheoretical
Erdos-Posa theorem (1965, solved): for every k, there is a function f such that every graph either contains k vertex-disjoint cycles or has a feedback vertex set of size at most f(k); f(k) = O(k log k) is tight.
source binding
source-boundErdos, Posa 1965, Canadian J. Math.
vs_d2618ca3fa60838b
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Erdos-Posa theorem (1965, solved): for every k, there is a function f such that every graph either contains k vertex-disjoint cycles or has a feedback vertex set of size at most f(k); f(k) = O(k log k) is tight.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_befc0be9698a8829
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_c43a6f1bfcd058adfinding.assertedManual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_115e49d5f9193419finding.addManual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10
evaluations
No evaluation rows are attached.