Skip to content

Erdős problem 1014

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:d66d741571e4b5c080a0586569f5933edb50f23f7ab5e1a993341cb7a20c7f42
Metadata
sha256:c018e679120132c7865fde468199bedc037956f8d000b0540ed06a721c7a2990
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:08116306a9a9b96edb97ab98ee49a05c56373f397c786d47b2fce9e8e384417d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page