Sign inSign in
ConceptMathematics

Ramsey number

Ramsey numbers measure the minimum graph order required to guarantee the existence of a specific clique or independent set.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Clique3Independent sets2Graph1Graph theory1Ramsey theory1Stable set1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Prabhakar Raghavan

    UC Berkeley · Research

    The smallest graph order with no r-clique or s-independent set, denoted R(r,s).

Connections

6

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.