A clique in a graph G $=($V$,$E$)$ is a subset of nodes C $$ V such that each pair of nodes in C is adjacent,

i$.$e$.,$u$,$ v in C$,($u$,$ v$)$ in E$.$ We want to find the largest clique $($i$.$e$.,$ a clique with the maximum number

of nodes$)$ in a given graph. Write an integer linear program that, if solved, will find the largest clique.