Network structure: k-cliques vs. p-cliques In network structure, what is the difference between k-cliques and p-cliques, can anyone give a brief explaination with examples? Thanks in advanced!

============================
EDIT:
I found an online ppt while I am googling, please take a look on p.37 and p.39, can you comment on them?
In graph theory a clique indicates a fully connected set of nodes: as noted here, a p-clique simply indicates a clique comoprised of p nodes. A k-clique is an undirected graph and a number k, and the output is a clique of size k if one exists.

Clique Problem