ConceptTheory & Algos
Chromatic number
The minimum number of colors needed to color a graph such that adjacent nodes have different colors.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
The least number of colors needed to color the vertices of a graph such that no two adjacent vertices share the same color.
Connections
4The lectures that define it or assume it, and the concepts next to it.