CliqueComplex(G,n):: Graph, Int --> SimplicialComplex
CliqueComplex(F,n):: FilteredGraph, Int --> FilteredSimplicialComplex
CliqueComplex(K,n):: SimplicialComplex, Int --> SimplicialComplex

Inputs a graph G and integer n \ge 1. It returns the n-skeleton of a simplicial complex K with one k-simplex for each complete subgraph of G on k+1 vertices.

Inputs a fitered graph F and integer n \ge 1. It returns the n-skeleton of a filtered simplicial complex K whose t-term has one k-simplex for each complete subgraph of the t-th term of G on k+1 vertices.

Inputs a simplicial complex of dimension d=1 or d=2. If d=1 then the clique complex of a graph returned. If d=2 then the clique complex of a $2$-complex is returned.