ConceptTheory & Algos
3-Clique (triangle-finding)
The problem of determining whether an undirected graph contains a triangle (3 vertices with all edges between them).
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
4The lectures that define it or assume it, and the concepts next to it.