Maximum clique
= Maximum clique
{title2=$|C|=\omega(G)$}
= Largest clique
{synonym}
A <maximum clique> is a <clique> with the greatest possible number of <vertices> in the <graph>. Its size is the <clique number>. Every <maximum clique> is a <maximal clique>, since adding a <vertex> would produce a larger <clique>. A <graph> can have several <maximum cliques>; the word maximum specifies their common size, rather than uniqueness.