ConceptTheory & Algos
K-clique
The problem of determining whether an undirected graph contains a clique of size K.
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.
4-Clique1Combinations1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.