Skip to content

Erdős problem 1014

Start work

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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:08116306a9a9b96edb97ab98ee49a05c56373f397c786d47b2fce9e8e384417d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON