The algorithmic problem of finding a maximum clique in a random graph drawn from the Erdős–Rényi model (in which each edge appears with probability 1/2, independently from the other edges) was suggested by Karp (1976).
Problema algoritmică de a găsi o clică maximă într-un graf aleator⁠(d) extras din modelul Erdős–Rényi⁠(d) (în care fiecare muchie apare cu probabilitatea 1/2, independent de celelalte muchii) a fost sugerată de către Karp (1976).