ConceptMathematics
Ramsey-type theorem
A theorem stating that any n-node graph in a given graph family without a (q+1)-clique contains a stable set of size n/q.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.