Clique cover

Clique cover --- кликовое покрытие.

Let [math]\displaystyle{ F }[/math] be a family of cliques. By a clique cover we mean a spanning subgraph of [math]\displaystyle{ G }[/math], each component of which is a member of [math]\displaystyle{ F }[/math]. With each element [math]\displaystyle{ \alpha }[/math] of [math]\displaystyle{ F }[/math] we associate an indeterminate (or weight) [math]\displaystyle{ w_{\alpha} }[/math], and with each cover [math]\displaystyle{ C }[/math] of [math]\displaystyle{ G }[/math] we assosiate the weight [math]\displaystyle{ w(C) = \prod_{\alpha \in C}w_{\alpha} }[/math].