The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial C_G(x) = sum_(k = ω_L(G))^(ω(G)) c_k x^k, where ω_L(G) is the lower clique number, ω(G) is the (upper) clique number, and the coefficient c_k of x_k is the number of maximal cliques in the graph G.

clique | clique number | lower clique number | maximal clique