I am actually trying to write a math expression of finding a clique with size x. I can tell it in English, but somehow it is hard for me to translate it into a math expression.
In a graph, G = (V(G), E(G)). If we need to find a clique with size x means to check if there exists x vertices, $V_1, V_2, ..., V_x$, such that .....
and then I do not know how to write a math expression to tell such that every node in $\{V_1, V_2, ..., V_x\}$ must have a link to every other node in $\{V_1, V_2, ..., V_x\}$ and all links must also belong to E(G).
If $E(G)$ is the set of unordered pairs $\{V_a,V_b\}$ of vertices $V_a,V_b\in V(G)$ that are connected by an edge, then you could finish your sentence as follows:
You might also want to emphasize that the vertices $V_1$, ..., $V_x$ should be distinct. You could also check