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-Faber-Lovasz conjecture (1972, solved for sufficiently large n in 2021): the chromatic index of the union of n complete graphs of order n that pairwise share at most one vertex is exactly n.

id: vea_b61cd0c99ddc73a6
frontier: Erdős problems frontier
source: vs_27bc8a8281231b5e
finding: vf_db51f8a305cbaaf0

evidence boundary

unknown

theoretical

finding binding

bound

theoretical

Erdos-Faber-Lovasz conjecture (1972, solved for sufficiently large n in 2021): the chromatic index of the union of n complete graphs of order n that pairwise share at most one vertex is exactly n.

source binding

source-bound

Kang, Kelly, Kuhn, Methuku, Osthus 2023, Annals of Mathematics

vs_27bc8a8281231b5e

review context

unverified

1 events

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

statement

Erdos-Faber-Lovasz conjecture (1972, solved for sufficiently large n in 2021): the chromatic index of the union of n complete graphs of order n that pairwise share at most one vertex is exactly n.

extraction method

manual_curation

support relation

unknown

condition refs

vcnd_de3055c187af81f8

caveats

missing evidence locator

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.

theoretical

theoretical

Kang, Kelly, Kuhn, Methuku, Osthus 2023, Annals of Mathematics

1 events

Review, event, and evaluation records

Search Vela