Erdős problem 1014 · problems.science

Let $R(k,l)$ be the Ramsey number, so the minimal $n$ such that every graph on at least $n$ vertices contains either a $K_k$ or an independent set on $l$ vertices.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#1014
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI standalone
Erdős AI contributions wiki · 23 Apr, 2026
Machine
OpenAI internal model
Open the source record
Conditional on conjectures
GPT-Erdős
Open the source record
argument
VibeMathed
Machine
OpenAI internal model
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science