As opposed to the listing variant, for \(p\) -clique detection the aforementioned hardness of obtaining lower bounds in the \(\mathsf {CLIQUE}\)  model by [1]} kicks in, and we do not know any non-constant lower bound (or any larger than 1 lower bound, for that matter), leaving the complexity of \(p\) -clique detection open for \(p>4\) .
