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

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

id: vs_27bc8a8281231b5e
frontier: Erdős problems frontier
year: 2023
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:Kang, Kelly, Kuhn, Methuku, Osthus 2023, Annals of Mathematics

imported

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

extraction mode

manual_curation

authors

agent:vela-curation-bot

caveats

No caveats recorded.

Bound findings

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

Evidence atoms

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

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.