Planted clique

The "planted clique" problem is a well-known computational problem in the field of theoretical computer science, particularly in the study of random graphs and computational complexity. It is often used as a benchmark problem for assessing the performance of algorithms designed for detection and clustering in graphs.