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

Erdos, Posa 1965, Canadian J. Math.

id: vs_d2618ca3fa60838b
frontier: Erdős problems frontier
year: 1965
type: paper

source boundary

frontier-owned

declared

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

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

citation

locator

title:Erdos, Posa 1965, Canadian J. Math.

imported

2026-05-10T19:27:57.712244+00:00

extraction mode

manual_curation

authors

agent:vela-curation-bot

caveats

No caveats recorded.

Bound findings

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.
theoretical · vf_98478e05babb8fb3

Evidence atoms

vea_1716e99ca4cbbee5theoretical · unknown
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.

Review, event, and evaluation records

events

vev_c43a6f1bfcd058adfinding.asserted
Manual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_115e49d5f9193419finding.add
Manual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10

evaluations

No evaluation rows are attached.