Clique — клика.
This is a subgraph induced by such that every pair of vertices is adjacent. The clique size of a clique is the number of vertices of . The maximum clique size of a clique in , , is called the clique number of . The clique number of a weighted graph is defined as the minimum weight of a clique in .
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.