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

Evidence atom

back to sources

Erdos-Ko-Rado theorem (1961, solved): for n >= 2k, the largest intersecting family of k-element subsets of {1,...,n} has size C(n-1, k-1) and consists of all k-sets containing a fixed element.

id: vea_3ededf637d122b6e
frontier: Erdős problems frontier
source: vs_def599cc44059c78
finding: vf_964e07212f5d6b57

evidence boundary

unknown

theoretical

finding binding

bound

theoretical

Erdos-Ko-Rado theorem (1961, solved): for n >= 2k, the largest intersecting family of k-element subsets of {1,...,n} has size C(n-1, k-1) and consists of all k-sets containing a fixed element.

source binding

source-bound

Erdos, Ko, Rado 1961, Quart. J. Math.

vs_def599cc44059c78

review context

unverified

1 events

1 reviewable changes and 0 evaluation records target this atom or its bound objects.

statement

Erdos-Ko-Rado theorem (1961, solved): for n >= 2k, the largest intersecting family of k-element subsets of {1,...,n} has size C(n-1, k-1) and consists of all k-sets containing a fixed element.

extraction method

manual_curation

support relation

unknown

condition refs

vcnd_e00cdaee41347ba6

caveats

missing evidence locator

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.

theoretical

theoretical

Erdos, Ko, Rado 1961, Quart. J. Math.

1 events

Review, event, and evaluation records

Search Vela