Sign inSign in

Chromatic number

The minimum number of colors needed to color a graph such that adjacent nodes have different colors.
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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The least number of colors needed to color the vertices of a graph such that no two adjacent vertices share the same color.

Connections

4

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

Concepts2

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.