Key points are not available for this paper at this time.
We study the problem of finding and listing k-cliques in an m-edge, n-vertex graph, for constant k≥ 3. This is a fundamental problem of both theoretical and practical importance.
Dalirrooyfard et al. (Mon,) studied this question.